| ||||||
| ||||||
Seminars | ||||||
| ||||||
| October 2010 | ||||||
|
|
|
|
||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||
|
Tuesday, October 5, 2010 |
|||
|
|
Oct 5 |
4:15 p.m. - 5:45 p.m. |
CS 201 - Google Tech Talk: Building a Probabilistic Transliteration Engine at Google, BRIAN MILCH, Google
|
|
|
|||
|
Thursday, October 7, 2010 |
|||
|
|
Oct 7 |
4:15 p.m. - 5:45 p.m. |
CS 201 John Postel Distinguished Lecture: Web Search: Challenges and Opportunities, BERTHIER RIBEIRO-NETO, Google Engineering
|
|
|
|||
|
Monday, October 11, 2010 |
|||
|
|
Oct 11 |
|
Columbus Day
|
|
|
|||
|
Tuesday, October 12, 2010 |
|||
|
|
Oct 12 |
4:15 p.m. - 5:45 p.m. |
CS Grad Student Panel
|
|
|
|||
|
Thursday, October 14, 2010 |
|||
|
|
Oct 14 |
4:15 p.m. - 5:45 p.m. |
CS 201: Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization, DANIEL GOLOVIN, Caltech’s Center for the Mathematics of Information
|
|
|
|||
|
Tuesday, October 19, 2010 |
|||
|
|
Oct 19 |
4:15 p.m. - 5:45 p.m. |
CS 201: Scalable Enterprise Networks with Inexpensive Switches, MINLAN YU, Princeton University
|
|
|
|||
|
Thursday, October 21, 2010 |
|||
|
|
Oct 21 |
4:15 p.m. - 5:45 p.m. |
CS 201: Blackwell Approachability meets Regret Minimization in the Dual, JAKE ABERNETHY, UC Berkeley
|
|
|
|||
|
Tuesday, October 26, 2010 |
|||
|
|
Oct 26 |
4:15 p.m. - 5:45 p.m. |
CS201: Responsibility For the Harm and Risk of Security Flaws - CASSIO GOLDSCHMIDT - Symantec Corporation
|
|
|
|||
|
Thursday, October 28, 2010 |
|||
|
|
Oct 28 |
4:15 a.m. - 5:45 p.m. |
CS 201: Multi-Version Concurrency via Timestamp Range Conflict Management, DAVID LOMET, Microsoft Research
|