Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time

From MaRDI portal
Revision as of 07:36, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2252137

DOI10.1016/j.jco.2013.08.001zbMath1294.65045arXiv1302.5936OpenAlexW2086190841MaRDI QIDQ2252137

Mark A. Iwen

Publication date: 16 July 2014

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.5936


zbMATH Keywords

sparse matricescompressed sensingrecovery algorithmsublinear-time algorithms


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (7)

Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery ⋮ Sparse recovery properties of discrete random matrices ⋮ Fast Phase Retrieval from Local Correlation Measurements ⋮ Robust sparse phase retrieval made easy ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Construction of Sparse Binary Sensing Matrices Using Set Systems ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares



Cites Work


This page was built for publication: Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2252137&oldid=14802679"
Powered by MediaWiki