Pages that link to "Item:Q2252137"
From MaRDI portal
The following pages link to Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137):
Displaying 10 items.
- Robust sparse phase retrieval made easy (Q347523) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← links)
- Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery (Q2124653) (← links)
- Construction of Sparse Binary Sensing Matrices Using Set Systems (Q2801915) (← links)
- Approximate sparse recovery: optimizing time and measurements (Q2875175) (← links)
- Efficiently decodable compressed sensing by list-recoverable codes and recursion (Q2904764) (← links)
- Fast Phase Retrieval from Local Correlation Measurements (Q3179618) (← links)
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
- Sparse recovery properties of discrete random matrices (Q5885198) (← links)
