For my thesis I'm writing a general-purpose library for doing piecewise polynomial computations. The difficulty lies in how to provide, in one library, for all the different computations required. The solution is to provide a small set of efficient high-level operations which can be used to code all needed computations easily.
In this talk, I will talk the library--the Blossom Classes--and the operations provided.
ICR Colloquium ``Consistent Modelling of Noisy Communication Channels for Syntactic Pattern Recognition'' B. John Oommen, Computer Science, Carleton University Wednesday, March 8, 3:30 p.m.; DC1302
^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^*^* the PURE MATH & C&O CLUB presents..... Professor W. Gilbert " Newton's Method for Complex Roots " o------------------o We first look at Newton's Method for approximating real roots of functions, and consider a little of the history of the method (Newton did one example and did not use calculus!). We then apply the method to approximate complex roots. When does the method work and what can go wrong? How can we modify the method? We show a connection with complex dynamics in the plane and, of course, fractals. o------------------o March 8, 1995, 4:30 - 5:30 MC 4041 ** Delightful refreshments will be served **
ICR Seminar ``Compilers: New Directions and New Challenges'' Frances E. Allen, IBM Fellow and Technical Consultant to the VP of Services Applications and Solutions IBM, TJ Watson Research Center, Yorktown Heights, NY Thursday, March 9, 3:30 p.m.; DC1302For an appointment to speak with Dr. Allen, please contact G.V.Cormack
VLSI Seminar ``Finite State Machines and Differential Equations: using dynamical systems theory to understand VLSI circuits'' Mark Greenstreet, University of British Columbia Friday, March 10, 10:30 - 11:30 a.m.; DC1304
8. Lab Cleanup (till 2:30pm or 5 minutes, whichever is longer)