Sparse Recovery with Partial Support Knowledge

DOI10.1007/978-3-642-22935-0_3zbMath1343.94019OpenAlexW2399534654MaRDI QIDQ3088079

Khanh do Ba, Piotr Indyk

Publication date: 17 August 2011

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation algorithms (68W25)

Uses Software

• poolMC

Cites Work

• Unnamed Item
• Unnamed Item
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
• On data structures and asymmetric communication complexity
• Approximate sparse recovery
• NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
• Data Streams: Algorithms and Applications
• Combinatorial Algorithms for Compressed Sensing
• DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
• Model-Based Compressive Sensing
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Efficient Sketches for the Set Query Problem
• Lower Bounds for Sparse Recovery
• Stable signal recovery from incomplete and inaccurate measurements
• (1 + eps)-Approximate Sparse Recovery
• Compressed sensing
• LATIN 2004: Theoretical Informatics

This page was built for publication: Sparse Recovery with Partial Support Knowledge