CATS-May-23-2014
From Theory
Title[edit]
Analyzing Big Graphs via Sketching and Streami
Speaker[edit]
Andrew McGregor, Department of Computer Science at the University of Massachusetts, Amherst
Abstract[edit]
Early work on data stream algorithms focused on estimating numerical statistics such as quantiles, frequency moments, and heavy hitters given limited memory and a single pass over the input. However, there's now a growing body of work on analyzing more structured data such as graphs. In this talk, we survey research in this area with a focus on recent results on dimensionality reduction via random projections and processing dynamic graphs.
