MEETING-DATE:November 8, 2012 MEETING-LOCATION:DC 1331 MEETING-TIME:11:30 MEETING-CHAIR:Grace Yao MEETING-CHAIRPIC:grace.jpg COFFEE-HOUR-LAST-WEEK:Elodie COFFEE-HOUR-THIS-WEEK:Volunteers? COFFEE-HOUR-NEXT-WEEK:Volunteers? FORTH-DATE1:November 15, 2012 FORTH-DATE2:November 22, 2012 FORTH-DATE3:November 29, 2012 FORTH-DATE4:December 6, 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:Zainab AlMeraj FORTH-CHAIR2:Bill Cowan FORTH-CHAIR3:Elodie Fourquet FORTH-CHAIR4:Tiffany Inglis FORTH-CHAIRPIC1:zainab.jpg FORTH-CHAIRPIC2:cowan_unflipped.gif FORTH-CHAIRPIC3:elodie.jpg FORTH-CHAIRPIC4:tiffany.jpg FORTH-TP1:Dan Vogel FORTH-TP2:Grace Yao FORTH-TP3:Zainab AlMeraj FORTH-TP4:Bill Cowan FORTH-TPPIC1:dvogel.jpg FORTH-TPPIC2:grace.jpg FORTH-TPPIC3:zainab.jpg FORTH-TPPIC4:cowan_unflipped.gif TPNAME:Matthew Thorne TPTITLE:Flattening Comics TPABSTRACT:"Flatting" is a common first step when digitally colouring comics which can be a tedious, manual process. Today, I will briefly describe how flatting is done and discuss some work-in-progress whose goal is to reduce much of the tedium of the flatting process. TPPIC:thorne.jpg DIONE:health and safety inspection of DC DITWO: DITHREE: DIFOUR: AIONE: AITWO: AITHREE: AIFOUR: LEONE:Monthly games night: Nov 16 in the lab, after coffee hour. LETWO: LETHREE: LEFOUR: DMONE: DMTWO: DMTHREE: DMFOUR: SEMINARS:
2012 Nov 09, 11:30 @ DC 2306C(AI Lab) Artificial Intelligence Lab Seminar
Dr. Mohammad Ghavamzadeh, INRIA Lille - Team SequeL, FranceTwo Adaptive Resource Allocation Problems
2012 Nov 14, 13:30 @ DC 1304 Algorithms and Complexity Group Seminar
Kazuto Kawamura, Tohoku UniversityReconfiguration of List L(2,1)-Labelings in a Graph
2012 Nov 14, 14:30 @ DC 1331 Database Research Group PhD Seminar
Zhiping Wu, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. WaterlooEfficient Implementation for Access Control Systems
2012 Nov 15, 15:30 @ DC 1302 Distinguished Lecture Series Seminar
Jennifer Chayes, MicrosoftThe Power of Locality for Network Algorithms