On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)

Details On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1) On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)

2010-11-26

arxiv.org/abs/1011.5936v1

Computer Science

Information Theory

Scientific paper

It is known that a high-dimensional sparse vector x* in R^n can be recovered from low-dimensional measurements y= A^{m*n} x* (m

Affiliated with

Also associated with

No associations

Rating

On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1) 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 On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-589038