Pages that link to "Item:Q5282643"
From MaRDI portal
The following pages link to One-Bit Compressed Sensing by Greedy Algorithms (Q5282643):
Displaying 6 items.
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints (Q2108537) (← links)
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares (Q3174766) (← links)
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate (Q5030352) (← links)
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials (Q5160076) (← links)
- Characterization of ℓ1 minimizer in one-bit compressed sensing (Q5236754) (← links)
- Just least squares: binary compressive sampling with low generative intrinsic dimension (Q6159304) (← links)