Colloquia
New Encryption Primitives for Uncertain Times
[ May 28, 2014; 3:30 pm to 4:30 pm. ] UCSB Computer Science Department Presents:
Wednesday May 28, 2014
3:30-4:30pm
Room 1132 Harold Frank Hall
Title: New Encryption Primitives for Uncertain Times
Speaker: Thomas Ristenpart, University of Wisconsin Madison
Host: Stefano Tessaro
Abstract:
I’ll talk about our recent work on a variety of new encryption mechanisms that deal with various functionality and security deficiencies in conventional schemes. We’ll start with format-transforming encryption, a tool [...]
CORFU and TANGO: Transactional Data Services over a Shared Log
[ May 5, 2014; 3:30 pm to 4:30 pm. ] UCSB Computer Science Department Presents:
Monday May 5, 2014
3:30-4:30pm
Harold Frank Hall 1132
Title: CORFU and TANGO: Transactional Data Services over a Shared Log
Speaker: Dahlia Malkhi, Microsoft Research, Silicon Valley
Host: Ben Zhao
Abstract:
Conventional wisdom has it that, the only way to scale replicated services is by partitioning the data. What would you do if given an infrastructure that breaks the [...]
Large Scale Machine Learning with the SimSQL System
[ April 28, 2014; 3:30 pm to 4:30 pm. ] UCSB Computer Science Department Presents:
Monday April 28, 2014
3:30-4:30pm
Room 1132 Harold Frank Hall
Title: Large Scale Machine Learning with the SimSQL System
Speaker: Chris Jermaine, Rice University
Host: Amr El Abbadi
Abstract:
In this talk, I’ll describe the SimSQL system, which is a platform for writing and executing machine learning codes. Since SimSQL is at its heart a relational database system, [...]
Getting Answers: The Technology Behind Watson
[ April 7, 2014; 3:30 pm to 4:30 pm. ] UCSB Computer Science Department Presents:
Monday April 7, 2014
3:30-4:30pm
ESB 1001
Title: Getting Answers: The Technology Behind Watson
Speaker: Ioana Roxana Stanoi, IBM
Host: Amr El Abbadi
Abstract:
In February of 2011 a computer program designed and built by IBM Research defeated the two best human players on one of the most challenging question/answer game shows of all time, Jeopardy! Named, Watson, after [...]
Measuring and Manipulating the Robustness of Large Networks
[ March 17, 2014; 3:30 pm to 4:30 pm. ] UCSB Computer Science Department Presents:
Monday March 17, 2014
3:30-4:30pm
Room 1132 Harold Frank Hall
Title: Measuring and Manipulating the Robustness of Large Networks
Speaker: Leman Akoglu, Stony Brook University
Host: Xifeng Yan
Abstract:
The function and performance of networks rely on their robustness, defined as their ability to continue functioning in the face of damage (targeted attacks or random failures) to parts of [...]
Archives
- May 2014
- April 2014
- March 2014
- February 2014
- January 2014
- December 2013
- November 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- January 2010
- December 2009
- November 2009
- October 2009
- September 2009
- August 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
- January 2009
- December 2008
- November 2008
- October 2008
- September 2008
- August 2008
- June 2008
- May 2008
- April 2008
- March 2008
- February 2008
- January 2008
- December 2007
- November 2007
- October 2007
- September 2007
- August 2007
- July 2007
- June 2007
- May 2007
- April 2007
- March 2007
- January 2007
- December 2006
- November 2006
- October 2006
- September 2006
- August 2006
- June 2006
- April 2006
- March 2006
- February 2006
- January 2006
- December 2005
- November 2005
- August 2005
- June 2005