Back to Results
First PageMeta Content
Numerical linear algebra / Matrix theory / Sparse matrix / Matrix / Sparse approximation / Belief propagation / Eigenvalues and eigenvectors / Time complexity / Algebra / Mathematics / Linear algebra


1 Sparse Recovery Using Sparse Matrices Anna Gilbert, Piotr Indyk Abstract—We survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices
Add to Reading List

Document Date: 2010-05-15 17:43:14

Open Document

File Size: 210,22 KB

Share Result on Facebook

City

Davenport / /

Company

A. R. Calderbank / World Scientific / /

Currency

pence / /

/

Event

Product Issues / /

Facility

University of Michigan / Rice University / /

IndustryTerm

row tensor product / randomized algorithms / compressive imaging camera architecture using optical-domain compression / message-passing algorithms / data stream processing / for-each algorithms / Internet measurement / dot product / l1 minimization algorithm / next6 algorithm / above algorithm / near-linear time algorithms / iterative decoding algorithms / imaging / iterative algorithms / sublinear-space algorithms / above algorithms / sparse recovery algorithms / combinatorial / chemical and biological applications / for-all algorithms / compressive sensing hardware / matrix-vector product / sublinear algorithm / recent iterative algorithms / l1 minimization algorithms / hardware devices / data stream computing / recovery algorithm / high throughput carrier screen / recovery algorithms / compressed sensing hardware / digital signal processing / sublinear algorithms / /

Organization

University of Michigan / Ann Arbor / National Science Foundation / MIT / Computer Engineering Department / Center for Massive Data Algorithmics / Department of Mathematics / Rice University / Department of Electrical Engineering and Computer Science / Danish National Research Association / /

Person

Kevin Kelly / Frank K. Hwang / Michael B. Wakin / Richard G. Baraniuk / Dror Baron / Marco F. Duarte / Ding-Zhu Du / Jason Laska / Shriram Sarvotham / Graham Cormode / David Packard / Lucille Packard / /

/

Position

rt / head / indicator variable rt / /

Product

elements / set / /

ProgrammingLanguage

E / /

ProvinceOrState

Michigan / /

PublishedMedium

Theoretical Computer Science / Communications of the ACM / /

Technology

above algorithms / above algorithm / iterative algorithms / recent iterative algorithms / C. Sublinear algorithms / near-linear time algorithms / Count-Min algorithm / sparse recovery algorithms / l1 minimization algorithm / SMP algorithm / Count-Min algorithms / recovery algorithm / sublinear algorithm / iterative decoding algorithms / message-passing algorithms / Count-median algorithms / specific algorithms / aforementioned algorithms / DNA Chip / recovery algorithms / Count-Sketch algorithm / Data Mining / EMP algorithm / l1 minimization algorithms / Sublinear algorithms / SMP algorithms / sublinear-space algorithms / Count-Median algorithm / B. Count-Sketch The next6 algorithm / network router / for-all algorithms / DSP / HHS algorithm / Sparse Matching Pursuit algorithm / for-each algorithms / linearprogramming-based recovery algorithm / /

URL

http /

SocialTag