The following pages link to Karin Schnass (Q434414):
Displaying 12 items.
- Learning functions of few arbitrary linear parameters in high dimensions (Q434415) (← links)
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms (Q734954) (← links)
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252) (← links)
- Compressed dictionary learning (Q2310825) (← links)
- (Q2807981) (← links)
- Compressed Sensing and Redundant Dictionaries (Q3604675) (← links)
- Dictionary Preconditioning for Greedy Algorithms (Q4568680) (← links)
- Online and Stable Learning of Analysis Operators (Q4628163) (← links)
- Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation (Q5006456) (← links)
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization (Q5281419) (← links)
- Local Identification of Overcomplete Dictionaries (Q5744800) (← links)
