Date: | March 31, 2010 |
---|---|
Location: | DC 1331 |
Time: | 1:30 |
Chair: | Maxime Quiblier |
Date: | April 7, 2010 | April 14, 2010 | April 21, 2010 | April 28, 2010 |
---|---|---|---|---|
Location: | DC 1331 1:30 | DC 1331 1:30 | DC 1331 1:30 | DC 1331 1:30 |
Chair: | Andrew Seniuk |
Martin Talbot |
Mike Terry |
Matthew Thorne |
Technical Presentation: | Alex Pytel |
Maxime Quiblier |
Zainab AlMeraj |
Andrew Seniuk |
Abdallah Rababah |
Title : High Order Approximation Methods
Abstract: In this talk, the following conjecture will be illustrated: Conjecture: A smooth regular curve in Rē can be approximated by a polynomial curve of degree <= m with order 2m. This Conjecture generalizes the Taylor theorem and achieves the accuracy of 2m for planar curves (rather than m+1). Examples and figures are presented to show the efficiency of these methods. |
---|
2010 Apr 01, 10:00, Computer Graphics Research Group Master's Thesis Presentation Jingyuan Huang, graduate student, David R. Cheriton School of Comp. Sci., Univ. Waterloo Image-Based Relighting 2010 Apr 05, 10:30, Computer Science Seminar Kartie Subr, Computer Graphics Group, INRIA-Grenoble Algorithms and numerical techniques for the efficient synthesis of photo-realistic images 2010 Apr 06, 14:30, Software Engineering Research Group Seminar E.C.R. Hehner, Dept. Comp. Sci., University of Toronto a Probability Perspective 2010 Apr 07, 14:30 - Database Research Group PhD Seminar Umar Farooq Minhas, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. Waterloo High Availability for Database Systems through Remus
Also see other Math and CS postings.