Sparse recovery with partial support knowledge
From MaRDI portal
Publication:3088079
Recommendations
Cites work
- scientific article; zbMATH DE number 3944477 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- (1 + eps)-Approximate Sparse Recovery
- Approximate sparse recovery: optimizing time and measurements
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Combinatorial Algorithms for Compressed Sensing
- Compressed sensing
- DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
- Data Streams: Algorithms and Applications
- Efficient sketches for the set query problem
- LATIN 2004: Theoretical Informatics
- Lower bounds for sparse recovery
- Model-Based Compressive Sensing
- NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
- On data structures and asymmetric communication complexity
- Stable signal recovery from incomplete and inaccurate measurements
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
Cited in
(6)- Regularized Modified BPDN for Noisy Sparse Reconstruction With Partial Erroneous Support and Signal Value Knowledge
- Computing and analyzing recoverable supports for sparse reconstruction
- Partial \(S\)-goodness for partially sparse signal recovery
- A short note on compressed sensing with partially known signal support
- Adaptive sparse recovery with limited adaptivity
- Signal recovery with partially known signal support
This page was built for publication: Sparse recovery with partial support knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088079)