Approximate sparse recovery
From MaRDI portal
Publication:2875175
DOI10.1145/1806689.1806755zbMath1293.94022OpenAlexW2020301027MaRDI QIDQ2875175
Ely Porat, Yi Li, Martin J. Strauss, Anna C. Gilbert
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806755
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25) Randomized algorithms (68W20) Decoding (94B35)
Related Items
A Survey of Compressed Sensing ⋮ Fingerprints for highly similar streams ⋮ Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time ⋮ Sparse Recovery with Partial Support Knowledge ⋮ Unnamed Item ⋮ Efficient sampling of non-strict turnstile data streams
