Sublinear time, measurement-optimal, sparse recovery for all
From MaRDI portal
Publication:5743471
Recommendations
Cites work
- scientific article; zbMATH DE number 5485456 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Approximate sparse recovery: optimizing time and measurements
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Combinatorial Algorithms for Compressed Sensing
- Compressed sensing
- Concentration of Measure for the Analysis of Randomized Algorithms
- LATIN 2004: Theoretical Informatics
- Lower bounds for sparse recovery
- Probability and Computing
- Stable signal recovery from incomplete and inaccurate measurements
Cited in
(8)- Adaptive sparse recovery with limited adaptivity
- Approximate sparse recovery: optimizing time and measurements
- Approximate sparse recovery: optimizing time and measurements
- On fast decoding of high-dimensional signals from one-bit measurements
- A general theory for subspace-sparse recovery
- Nearly linear-time model-based compressive sensing
- Stronger \(\ell_2/\ell_2\) compressed sensing; without iterating
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time
This page was built for publication: Sublinear time, measurement-optimal, sparse recovery for all
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743471)