Date: | April 8th, 2009 |
---|---|
Location: | DC 1331 |
Time: | 1:30 |
Chair: | Ryan Stedman |
Date: | April 15th, 2009 | April 22nd, 2009 | April 29th, 2009 | May 6th, 2009 |
---|---|---|---|---|
Location: | DC 1331 1:30 | DC 1331 1:30 | DC 2303 1:30 | DC 1304 1:30 |
Chair: | Stephen Mann |
Michael McCool |
Zainab Meraj |
Alex Pytel |
Technical Presentation: | Kate Kinnear |
Ben Lafreniere |
Stephen Mann |
Michael McCool |
Craig Kaplan |
Title : An introduction to orbifolds
Abstract: Orbifolds are an elegant, intuitive and practical way to think about the symmetries of patterns. In this talk I'll explain what an orbifold is, how simple symmetry groups can be described based on their orbifold structures, and how they can be used to derive facts about symmetry groups and tilings. |
---|
2009 Apr 15, 13:30 — Algorithms and Complexity Group Master's Thesis Presentation Pat Nicholson, graduate student, David R. Cheriton School of Comp. Sci., Univ. Waterloo The application of the in-tree knapsack problem to routing prefix caches
2009 Apr 15, 14:00 — Programming Languages Lab PhD Seminar Thomas Lynam, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. Waterloo TREC Legal Track Experiments
Also see other Math and CS postings.