Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching
DOI10.1137/1.9781611974331.ch24zbMath1410.68115arXiv1504.01076OpenAlexW771946922MaRDI QIDQ4575601
Ilya Razenshteyn, David P. Woodruff, Artūrs Bačkurs, Piotr Indyk
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01076
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (1)
This page was built for publication: Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching