Pages that link to "Item:Q2841676"
From MaRDI portal
The following pages link to One-bit compressed sensing by linear programming (Q2841676):
Displaying 17 items.
- (Q5148995) (← links)
- Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces (Q5230191) (← links)
- On the Atomic Decomposition of Coorbit Spaces with Non-integrable Kernel (Q5230193) (← links)
- Characterization of ℓ1 minimizer in one-bit compressed sensing (Q5236754) (← links)
- One-Bit Compressed Sensing by Greedy Algorithms (Q5282643) (← links)
- One-bit sensing, discrepancy and Stolarsky's principle (Q5369384) (← links)
- Advances in Neural Networks – ISNN 2005 (Q5707051) (← links)
- Iteratively consistent one-bit phase retrieval (Q5873934) (← links)
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition (Q6051152) (← links)
- A unified approach to uniform signal recovery from nonlinear observations (Q6101267) (← links)
- Robust one-bit compressed sensing with partial circulant matrices (Q6104014) (← links)
- Compressive phase retrieval: Optimal sample complexity with deep generative priors (Q6141977) (← links)
- UNIFORM-IN-SUBMODEL BOUNDS FOR LINEAR REGRESSION IN A MODEL-FREE FRAMEWORK (Q6145543) (← links)
- Just least squares: binary compressive sampling with low generative intrinsic dimension (Q6159304) (← links)
- Performance bounds of the intensity-based estimators for noisy phase retrieval (Q6185682) (← links)
- A reliable iteration algorithm for one-bit compressive sensing on the unit sphere (Q6565536) (← links)
- Uniform recovery guarantees for quantized corrupted sensing using structured or generative priors (Q6623969) (← links)
