Pages that link to "Item:Q1039884"
From MaRDI portal
The following pages link to A simple proof of the restricted isometry property for random matrices (Q1039884):
Displaying 50 items.
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms (Q734954) (← links)
- Hard thresholding pursuit algorithms: number of iterations (Q739467) (← links)
- Matrix-free interior point method for compressed sensing problems (Q744215) (← links)
- Rigorous restricted isometry property of low-dimensional subspaces (Q778034) (← links)
- RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction (Q889379) (← links)
- Stability of the elastic net estimator (Q895982) (← links)
- Sampling in the analysis transform domain (Q900778) (← links)
- Interpolation via weighted \(\ell_{1}\) minimization (Q905907) (← links)
- From compression to compressed sensing (Q905909) (← links)
- A strong restricted isometry property, with an application to phaseless compressed sensing (Q905910) (← links)
- On the conditioning of random subdictionaries (Q930731) (← links)
- Sparsity in time-frequency representations (Q967573) (← links)
- Sparse recovery by non-convex optimization - instance optimality (Q984656) (← links)
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) (Q1012556) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- Random projections of smooth manifolds (Q1029551) (← links)
- Compressive sensing for subsurface imaging using ground penetrating radar (Q1032423) (← links)
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles (Q1039886) (← links)
- On principal components regression, random projections, and column subsampling (Q1616329) (← links)
- Improved bounds for sparse recovery from subsampled random convolutions (Q1634177) (← links)
- A novel probabilistic approach for vehicle position prediction in free, partial, and full GPS outages (Q1664919) (← links)
- Random sampling of bandlimited signals on graphs (Q1690709) (← links)
- Robustness properties of dimensionality reduction with Gaussian random matrices (Q1703873) (← links)
- Random matrices and erasure robust frames (Q1704861) (← links)
- Linear regression with sparsely permuted data (Q1711600) (← links)
- Median filter based compressed sensing model with application to MR image reconstruction (Q1721512) (← links)
- An overview on the applications of matrix theory in wireless communications and signal processing (Q1736835) (← links)
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) (Q1747365) (← links)
- Adaptive compressive learning for prediction of protein-protein interactions from primary sequence (Q1783649) (← links)
- On the sparseness of 1-norm support vector machines (Q1784565) (← links)
- A novel measurement matrix optimization approach for hyperspectral unmixing (Q1794237) (← links)
- Compressed sensing and matrix completion with constant proportion of corruptions (Q1939501) (← links)
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements (Q1946588) (← links)
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons (Q1950804) (← links)
- Kernel conjugate gradient methods with random projections (Q1979923) (← links)
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems (Q1988352) (← links)
- Learning general sparse additive models from point queries in high dimensions (Q2007617) (← links)
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
- 2D compressed learning: support matrix machine with bilinear random projections (Q2008636) (← links)
- Compressed data separation via dual frames based split-analysis with Weibull matrices (Q2016924) (← links)
- Greedy variance estimation for the LASSO (Q2019914) (← links)
- Geometric component analysis and its applications to data analysis (Q2036489) (← links)
- Application of ESN prediction model based on compressed sensing in stock market (Q2038120) (← links)
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
- Image reconstruction based on improved block compressed sensing (Q2064972) (← links)
- Asymptotic analysis for extreme eigenvalues of principal minors of random matrices (Q2075335) (← links)
- Perturbation analysis of \(L_{1-2}\) method for robust sparse recovery (Q2082139) (← links)
- Fast and memory-optimal dimension reduction using Kac's walk (Q2090615) (← links)
- Increasing the semantic storage density of sparse distributed memory (Q2103732) (← links)
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
