MEETING-DATE:January 29, 2015
MEETING-LOCATION:DC 1331
MEETING-TIME:11:30
MEETING-CHAIR:Filipe de Carvalho Nascimento
MEETING-CHAIRPIC:nascimento.jpg
COFFEE-HOUR-LAST-WEEK:Egor?
COFFEE-HOUR-THIS-WEEK:Volunteers?
COFFEE-HOUR-NEXT-WEEK:Volunteers?
FORTH-DATE1:February 5, 2015
FORTH-DATE2:February 12, 2015
FORTH-DATE3:February 19, 2015
FORTH-DATE4:February 26, 2015
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:Tyler Nowicki
FORTH-CHAIR2:Alex Pytel
FORTH-CHAIR3:Reza Adhitya Saputra
FORTH-CHAIR4:Matthew Thorne
FORTH-CHAIRPIC1:tyler.jpg
FORTH-CHAIRPIC2:apytel.jpg
FORTH-CHAIRPIC3:chair.jpg
FORTH-CHAIRPIC4:thorne_katana.png
FORTH-TP1:Filipe de Carvalho Nascimento
FORTH-TP2:Lesley Northam
FORTH-TP3:Tyler Nowicki
FORTH-TP4:Alex Pytel
FORTH-TPPIC1:nascimento.jpg
FORTH-TPPIC2:LNortham.png
FORTH-TPPIC3:tyler.jpg
FORTH-TPPIC4:apytel.jpg
TPNAME:Stephen Mann
TPTITLE:Approximate Continuity on Biquadratic patches
TPABSTRACT:In this talk, I will investigate constraints on control points so that two biquadratic patches meet C0 along their boundaries, C1 at ends of their boundaries, and so that the angle between normals along the shared boundary is bounded by theta.  These results also apply to triangular, cubic Bezier patches.
TPPIC:smann-3.jpg
DIONE:
DITWO:
DITHREE:
DIFOUR:
AIONE:
AITWO:
AITHREE:
AIFOUR:
LEONE:Encaustic painting during reading week?
LETWO:
LETHREE:
LEFOUR:
DMONE:
DMTWO:
DMTHREE:
DMFOUR:
SEMINARS:<DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150102-1030.16642">Monday, 2 February 2015</A>, 10:30AM - Computer Science  (<em>Cryptography, Security, and Privacy (CrySP) Group</em>), DC 2314 <nl><DD> Vladimir Soukharev: -- <EM> Isogeny-Based Cryptography </EM><BR>&#160;<BR> <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150102-1030.17001">Monday, 2 February 2015</A>, 10:30AM - Computer Science  , DC 1304 <nl><DD> Walter S. Lasecki: -- <EM> Crowd-Agents: Creating Crowd-Powered Interactive Systems </EM><BR>&#160;<BR>   <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150103-1400.8781">Tuesday, 3 February 2015</A>, 2:00PM - Computer Science  (<em>Human-Computer Interaction</em>), DC 2314 <nl><DD> William Saunders: -- <EM> Designing a Foot Input System for Productive Work at a Standing Desk </EM><BR>&#160;<BR> <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150104-1100.24743">Wednesday, 4 February 2015</A>, 11:00AM - Computer Science  (<em>ISS4E</em>), DC 2585 <nl><DD> Omid Ardakanian: -- <EM> Cost-Effective Integration of Distributed Solar Generation: A Utility-Centric View </EM><BR>&#160;<BR> <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150104-1330.27608">Wednesday, 4 February 2015</A>, 1:30PM - Computer Science  (<em>Algorithms and Complexity Group</em>), DC 1304 <nl><DD> Amer Mouawad: -- <EM> Reconfiguration on sparse graphs </EM><BR>&#160;<BR> <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150105-1030.18323">Thursday, 5 February 2015</A>, 10:30AM - Computer Science  , DC 1304 <nl><DD> Dr. Willis Lang: -- <EM> Redefining the Rules for Data Processing in the Cloud' </EM><BR>&#160;<BR> <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150105-1530.1408">Thursday, 5 February 2015</A>, 3:30PM - Computer Science  (<em>Distinguished Lecture Series</em>), DC 1302 <nl><DD> Leslie Pack Kaelbling: -- <EM> Making Robots Behave </EM><BR>&#160;<BR> <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150106-0930.13628">Friday, 6 February 2015</A>, 9:30AM - Computer Science  (<em>Algorithms and Complexity Group</em>), DC 2314<nl><DD> Amer Mouawad: -- <EM> On Reconfiguration problems: Structure and Tractability </EM><BR>&#160;<BR>  <nl><DT><A HREF="https://www.math.uwaterloo.ca/~wnotice/notice_prgms/wreg/list_full.pl?20150106-1420.1413">Friday, 6 February 2015</A>, 2:20PM - Computer Science  (<em>Symbolic Computation Group</em>), DC 1302 <nl><DD> Daniel Parario: -- <EM> Analytic and Probabilistic Combinatorics for Polynomials over Finite Fields </EM><BR>&#160;<BR>