Pages that link to "Item:Q2465825"
From MaRDI portal
The following pages link to Deterministic constructions of compressed sensing matrices (Q2465825):
Displayed 17 items.
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries (Q420768) (← links)
- Sparse representations and approximation theory (Q630502) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
- Explicit constructions of RIP matrices and related problems (Q635478) (← links)
- Steiner equiangular tight frames (Q665926) (← links)
- Instance-optimality in probability with an \(\ell _1\)-minimization decoder (Q734324) (← links)
- Optimal non-linear models for sparsity and sampling (Q734950) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Nonlinear least squares in \(\mathbb R^{N}\) (Q1038734) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Compressed sensing by inverse scale space and curvelet thresholding (Q2378722) (← links)
- Deterministic sampling of sparse trigonometric polynomials (Q2431334) (← links)
- Theory and applications of compressed sensing (Q2864809) (← links)
- Linearized Bregman iterations for compressed sensing (Q3055156) (← links)
- Mathematics of Analog‐to‐Digital Conversion (Q4650167) (← links)