PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 17, 2010143 citations

Lower bounds for sparse recovery

View Full Paper
KBKhanh Do BaPIPiotr IndykEPEric Price

Key Points

Key points are not available for this paper at this time.

Abstract

We consider the following k-sparse recovery problem: design an m × n matrix A, such that for any signal x, given Ax we can efficiently recover ˆx satisfying

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Ba et al. (2010) studied this question.

synapsesocial.com/papers/6a2004372065d284090dceabhttps://doi.org/10.5555/1873601.1873696
Ask AI
Helpful
Bookmark
Share
View Full Paper