Events — Colloquia & Seminars
Massive Data Set Computations - Algorithms and Complexity
Speaker: T. S. Jayram, IBM Almaden Research Center
Date: Wednesday, August 25, 2004
Talk: 11:00 AM, 366 West Village H
Abstract
Recent work in information retrieval, databases, and networking has led to the creation of massive data sets. The applications that operate on such data face severe limits on how the data can be accessed and this leads to non-traditional computational challenges. In this talk, I will present some of my work in this area. In particular, I will present algorithms in two models that are prominent in massive data set computations---streaming and sketching. Along the way, I hope to give a sense of some of the algorithmic techniques that have proved to be successful. If time permits, I will also touch upon the "other side" of my work, namely, proving lower bounds in such models.
Brief Biography
T.S. Jayram is a Research Staff Member at IBM Almaden Research Center. After obtaining his PhD from University of Washington in 1998, he worked at IBM TJ Watson, and then moved to IBM Almaden in 2001. His interests include algorithms for massive data sets, communication complexity, and time-space tradeoffs. He received the Machtey Award for his paper that appeared in FOCS 1994.