A survey of sparse approximation

Joint ACO and ARC Colloquium
Thursday, October 29, 2009 - 11:05am for 1 hour (actually 50 minutes)
MiRC 102
Anna Gilbert – Mathematics, University of Michigan
Prasad Tetali
The past 10 years have seen a confluence of research in sparse approximation amongst computer science, mathematics, and electrical engineering. Sparse approximation encompasses a large number of mathematical, algorithmic, and signal processing problems which all attempt to balance the size of a (linear) representation of data and the fidelity of that representation. I will discuss several of the basic algorithmic problems and their solutions, including connections to streaming algorithms and compressive sensing.