Publication:4962672: Difference between revisions
From MaRDI portal
Publication:4962672
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page For-All Sparse Recovery in Near-Optimal Time to For-All Sparse Recovery in Near-Optimal Time: Duplicate |
(No difference)
| |
Latest revision as of 16:10, 2 May 2024
DOI10.1145/3039872zbMath1446.68196arXiv1402.1726OpenAlexW1491344380MaRDI QIDQ4962672
Ely Porat, Yi Li, Martin J. Strauss, Anna C. Gilbert
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms, Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.1726
Analysis of algorithms (68W40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation algorithms (68W25)
Related Items
Simple Codes and Sparse Recovery with Fast Decoding, Forty years of frequent items, Deterministic Heavy Hitters with Sublinear Query Time, Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
