Sparse Recovery Using Sparse Matrices
In this paper, we survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices has several attractive properties: they support algorithms with low computational complexity, and make it easy to perform incremental updates to signals. We discuss applications t...
Main Authors: | Gilbert, Anna, Indyk, Piotr |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2012
|
Online Access: | http://hdl.handle.net/1721.1/70932 https://orcid.org/0000-0002-7983-9524 |
Similar Items
-
Sparse Recovery Using Sparse Matrices
by: Gilbert, Anna, et al.
Published: (2021) -
Sparse recovery using sparse matrices
by: Berinde, Radu, et al.
Published: (2008) -
Sparse recovery with partial support knowledge
by: Do Ba, Khanh, et al.
Published: (2012) -
On the Power of Adaptivity in Sparse Recovery
by: Indyk, Piotr, et al.
Published: (2012) -
Lower bounds for sparse recovery
by: Indyk, Piotr, et al.
Published: (2011)