Sublinear Time, Approximate Model-based Sparse Recovery For All

Details Sublinear Time, Approximate Model-based Sparse Recovery For All Sublinear Time, Approximate Model-based Sparse Recovery For All

2012-03-21

arxiv.org/abs/1203.4746v1

Computer Science

Information Theory

18 pages

Scientific paper

We describe a probabilistic, {\it sublinear} runtime, measurement-optimal system for model-based sparse recovery problems through dimensionality reducing, {\em dense} random matrices. Specifically, we obtain a linear sketch $u\in \R^M$ of a vector $\bestsignal\in \R^N$ in high-dimensions through a matrix $\Phi \in \R^{M\times N}$ $(M

Affiliated with

Also associated with

No associations

Rating

Sublinear Time, Approximate Model-based Sparse Recovery For All does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sublinear Time, Approximate Model-based Sparse Recovery For All, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sublinear Time, Approximate Model-based Sparse Recovery For All will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488702