(1 + eps)-Approximate Sparse Recovery

DOI10.1109/FOCS.2011.92zbMath1292.94013OpenAlexW2091904714MaRDI QIDQ5495019

David P. Woodruff, Eric Price

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.92

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sampling theory in information and communication theory (94A20)

Related Items (6)

Taylor Polynomial Estimator for Estimating Frequency Moments ⋮ Unnamed Item ⋮ Improved Algorithms for Adaptive Compressed Sensing ⋮ On Low-Risk Heavy Hitters and Sparse Recovery Schemes ⋮ Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time ⋮ Sparse Recovery with Partial Support Knowledge

This page was built for publication: (1 + eps)-Approximate Sparse Recovery