Pages that link to "Item:Q3595390"
From MaRDI portal
The following pages link to A Fast Random Sampling Algorithm for Sparsifying Matrices (Q3595390):
Displaying 19 items.
- Toward a unified theory of sparse dimensionality reduction in Euclidean space (Q496171) (← links)
- Faster least squares approximation (Q623334) (← links)
- Sampling based succinct matrix approximation (Q930090) (← links)
- Computing sparse approximations deterministically (Q1915603) (← links)
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905) (← links)
- ReliefE: feature ranking in high-dimensional spaces via manifold embeddings (Q2127230) (← links)
- The fast Cauchy transform and faster robust linear regression (Q2812147) (← links)
- Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
- Improved matrix algorithms via the subsampled randomized Hadamard transform (Q2866237) (← links)
- Fast algorithm for the multiplication of a row vector by a randomly selected matrix<i>A</i> (Q3560579) (← links)
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1. (Q4603696) (← links)
- (Q4614124) (← links)
- (Q4633059) (← links)
- Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements (Q4636984) (← links)
- Sampling and multilevel coarsening algorithms for fast matrix approximations (Q5227180) (← links)
- Compressing Rank-Structured Matrices via Randomized Sampling (Q5739955) (← links)
- Comparison of matrix norm sparsification (Q6066776) (← links)
- A fast randomized algorithm for computing an approximate null space (Q6161581) (← links)
- Core-elements for large-scale least squares estimation (Q6643225) (← links)
