MEETING-DATE:October 27, 2016 MEETING-LOCATION:DC 1331 MEETING-TIME:11:30 MEETING-CHAIR:Xiang Fang MEETING-CHAIRPIC:chair.jpg COFFEE-HOUR-LAST-WEEK:Bill COFFEE-HOUR-THIS-WEEK:Xiang COFFEE-HOUR-NEXT-WEEK:Volunteers? FORTH-DATE1:November 3, 2016 FORTH-DATE2:November 10, 2016 FORTH-DATE3:November 17, 2016 FORTH-DATE4:November 24, 2016 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:Ryan Goldade FORTH-CHAIR2:Craig Kaplan FORTH-CHAIR3:Marta Kryven FORTH-CHAIR4:Stephen Mann FORTH-CHAIRPIC1:ryan.jpg FORTH-CHAIRPIC2:craig.jpg FORTH-CHAIRPIC3:marta.jpg FORTH-CHAIRPIC4:mann.jpg FORTH-TP1:Xiang Fang FORTH-TP2:Ryan Goldade FORTH-TP3:Craig Kaplan FORTH-TP4:Marta Kryven FORTH-TPPIC1:chair.jpg FORTH-TPPIC2:ryan.jpg FORTH-TPPIC3:craig.jpg FORTH-TPPIC4:marta.jpg TPNAME:Terence Dickson TPTITLE:Weighted Blended Order-Independent Transparency TPABSTRACT:Transparent objects can be simulated using partial coverage, but the operation is non-commutative, requiring a costly object-sorting step that is occasionally impossible. This paper presents a procedure for approximating the results of standard alpha blending using commutative operations, coincidentally providing better results for certain classes of scenes. TPPIC:ssiu-owl.jpg DIONE: DITWO: DITHREE: DIFOUR: AIONE: AITWO: AITHREE: AIFOUR: LEONE: LETWO: LETHREE: LEFOUR: DMONE: DMTWO: DMTHREE: DMFOUR: SEMINARS:
Thursday, 27 October 2016, 1:30PM - Pure Mathematics (Number Theory Seminar), MC 5479 [Newish]
Divyum Sharma: -- "Number of solutions of Thue Equations"
Thursday, 27 October 2016, 3:30PM - Combinatorics and Optimization , Math & Computer, Room 5479 [Newish]
Dr. Peter Nelson: -- The probability that a random subgraph contains a circuit
Friday, 28 October 2016, 3:30PM - Pure Mathematics (Analysis Seminar), MC 5417 [Newish]
Paul Skoufranis: -- Majorization in C*-Algebras
Friday, 28 October 2016, 3:30PM - Combinatorics and Optimization , Math & Computer, Room 5501 [Newish]
Gabriel Coutinho: -- Quantum walks on irregular graphs