Pages that link to "Item:Q1915603"
From MaRDI portal
The following pages link to Computing sparse approximations deterministically (Q1915603):
Displaying 13 items.
- On some deterministic dictionaries supporting sparsity (Q734953) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905) (← links)
- An Efficient Sparse Regularity Concept (Q3058542) (← links)
- Average Performance of the Sparsest Approximation Using a General Dictionary (Q3173502) (← links)
- Sparse approximation based on a random overcomplete basis (Q3302727) (← links)
- A Fast Random Sampling Algorithm for Sparsifying Matrices (Q3595390) (← links)
- A note on some upper bounds for permanents of (0, 1)-matrices (Q3622685) (← links)
- (Q3623653) (← links)
- Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform (Q4575600) (← links)
- Sparse Approximation via Generating Point Sets (Q4972677) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- A Greedy Algorithm for Sparse Precision Matrix Approximation (Q5079528) (← links)