Transparent Gif

Department of Computer Science

University of California, Santa Barbara

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 [...]

 
XHTML Validation | CSS Validation
Updated 04-Sep-2013
Questions should be directed to: webmaster@cs.ucsb.edu