MEETING-DATE:March 8, 2012 MEETING-LOCATION:DC 1331 MEETING-TIME:11:30 MEETING-CHAIR:Ben Lafreniere MEETING-CHAIRPIC:ben.jpg COFFEE-HOUR-LAST-WEEK:Volunteers? COFFEE-HOUR-THIS-WEEK:Bill COFFEE-HOUR-NEXT-WEEK:Ben FORTH-DATE1:March 15, 2012 FORTH-DATE2:March 22, 2012 FORTH-DATE3:March 29, 2012 FORTH-DATE4:April 5, 2012 FORTH-LOCATION1:DC 1331 11:30 FORTH-LOCATION2:DC 1331 11:30 FORTH-LOCATION3:DC 1331 11:30 FORTH-LOCATION4:DC 1331 11:30 FORTH-CHAIR1:Philippe Lamoureux FORTH-CHAIR2:Stephen Mann FORTH-CHAIR3:Lesley Northam FORTH-CHAIR4:Simon Parent FORTH-CHAIRPIC1:philippe-bright.jpg FORTH-CHAIRPIC2:smann.jpg FORTH-CHAIRPIC3:LNortham.png FORTH-CHAIRPIC4:Simon.png FORTH-TP1:Marta Kryven FORTH-TP2:Ben Lafreniere FORTH-TP3:Philippe Lamoureux FORTH-TP4:Stephen Mann FORTH-TPPIC1:martaPicture.jpg FORTH-TPPIC2:ben.jpg FORTH-TPPIC3:philippe-bright.jpg FORTH-TPPIC4:smann.jpg TPNAME:Craig Kaplan TPTITLE:Sampling Aperiodic Tilings TPABSTRACT:Drawing textures using graphics hardware usually relies on a sampling process, in which points in the plane are assigned colours in isolation from one another. With this sort of framework, it is easy to render periodic tilings, in which the geometry repeats predictably. But it is unclear whether there is any hope of developing a sampling approach for aperiodic tilings, in which there is, by definition, no strict repetition. I show that in the special case of quasiperiodic lattice projection tilings (including the Penrose rhombs), a sample-based rendering algorithm may still be possible. TPPIC:craig.jpg DIONE:Solar storm -- Did you see it? DITWO:Don't use the photocopier to make copies if you can just print extra copies instead. DITHREE:Photocopier will be repaired soon. DIFOUR:March 13 grad visits AIONE: AITWO: AITHREE: AIFOUR: DMONE: DMTWO: DMTHREE: DMFOUR: SEMINARS:
# 2012 Mar 08, 10:15 — Software Engineering Research Group PhD SeminarSarah Nadi, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. WaterlooMining Kbuild to Detect Variability Anomalies in Linux# 2012 Mar 08, 14:00 — Cryptography, Security, and Privacy (CrySP) Group PhD SeminarRyan Henry, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. WaterlooSolving Discrete Logarithms in Smooth Order Groups with CUDA# 2012 Mar 09, 11:00 — Symbolic Computation Group SeminarRomain Lebreton, Ιcole Polytechnique, Paris, FranceRelaxed Hensel lifting for algebraic systems# 2012 Mar 09, 11:30 — Artificial Intelligence Lab PhD SeminarRuth Urner, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. WaterlooLearning from Weak Teachers# 2012 Mar 09, 13:00 — Symbolic Computation Group SeminarJacques Carette, McMaster UniversityFrom structured theories to efficient code in 6 easy steps# 2012 Mar 14, 09:30 — Software Engineering Research Group PhD SeminarOlga Baysal, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. WaterlooMining Usage Data and Development Artifacts# 2012 Mar 14, 10:30 — Computer Science SeminarSpiros Papadimitriou, Research Scientist, GoogleLarge Graph Models and Scalable Analytics