- Series
- ACO Colloquium
- Time
- Tuesday, April 21, 2009 - 4:30pm for 2 hours
- Location
- Skiles 255
- Speaker
- Anna Gilbert – University of Michigan, Ann Arbor
- Organizer
- 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, focusing on special classes of matrices. I will conclude with an application in biological testing.