8 citations · 11 across the 2 of their papers we have counts for
2 papers
cs.IT2010★ 8 cited
Compressed Sensing: How sharp is the Restricted Isometry Property
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Compressed Sensing (CS) seeks to recover an unknown vector with entries by making far fewer than measurements; it posits that the number of compressed sensing measurements…
cs.IT2010★ 3 cited
Phase Transitions for Greedy Sparse Approximation Algorithms
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner +1
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, so…