Pages that link to "Item:Q3547716"
From MaRDI portal
The following pages link to Greed is Good: Algorithmic Results for Sparse Approximation (Q3547716):
Displaying 50 items.
- Sparse representations and approximation theory (Q630502) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- Autoregressive process modeling via the Lasso procedure (Q631620) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- Model decomposition and reduction tools for large-scale networks in systems biology (Q665143) (← links)
- On performance of greedy algorithms (Q719355) (← links)
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
- Iterative thresholding for sparse approximations (Q734940) (← links)
- Analysis of basis pursuit via capacity sets (Q734943) (← links)
- Optimal non-linear models for sparsity and sampling (Q734950) (← links)
- On some deterministic dictionaries supporting sparsity (Q734953) (← links)
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms (Q734954) (← links)
- Compressive sampling and rapid reconstruction of broadband frequency hopping signals with interference (Q736865) (← links)
- New cyclic sparsity measures for deconvolution based on convex relaxation (Q736973) (← links)
- Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots (Q739462) (← links)
- Sparse recovery via differential inclusions (Q739470) (← links)
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- GPU accelerated greedy algorithms for compressed sensing (Q744210) (← links)
- Variational approximation for heteroscedastic linear models and matching pursuit algorithms (Q746230) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- Theoretical guarantees for graph sparse coding (Q778037) (← links)
- Deterministic construction of sparse binary matrices via incremental integer optimization (Q781884) (← links)
- Inverse point source location with the Helmholtz equation on a bounded domain (Q782921) (← links)
- Measurement matrix design for CS-MIMO radar using multi-objective optimization (Q784574) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- High-dimensional variable selection (Q834336) (← links)
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy (Q836250) (← links)
- Modeling of electric disturbance signals using damped sinusoids via atomic decompositions and its applications (Q836633) (← links)
- Directional Haar wavelet frames on triangles (Q837545) (← links)
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure (Q877577) (← links)
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem (Q890462) (← links)
- Sparsity in time-frequency representations (Q967573) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- When do stepwise algorithms meet subset selection criteria? (Q995431) (← links)
- On the existence of equiangular tight frames (Q996316) (← links)
- Lasso-type recovery of sparse representations for high-dimensional data (Q1002157) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\) (Q1012556) (← links)
- K-hyperline clustering learning for sparse component analysis (Q1016854) (← links)
- Average performance of the approximation in a dictionary using an \(\ell _0\) objective (Q1018130) (← links)
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- KFCE: a dictionary generation algorithm for sparse representation (Q1032447) (← links)
- Nonlinear least squares in \(\mathbb R^{N}\) (Q1038734) (← links)
- Sparse solutions to underdetermined Kronecker product systems (Q1039753) (← links)
- Signal recovery under cumulative coherence (Q1624658) (← links)
- Secure estimation based Kalman filter for cyber-physical systems against sensor attacks (Q1626921) (← links)
- Equiangular tight frames that contain regular simplices (Q1654389) (← links)
- A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint (Q1662582) (← links)
- Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data (Q1666730) (← links)
- PROMP: a sparse recovery approach to lattice-valued signals (Q1669069) (← links)
