Pages that link to "Item:Q5189547"

The following pages link to The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors (Q5189547):

Displaying 15 items.

• Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. (Q5240430) (← links)
• Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 (Q5875504) (← links)
• PLSS: A Projected Linear Systems Solver (Q6039256) (← links)
• Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification (Q6062237) (← links)
• Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations (Q6064026) (← links)
• Principled interpolation of Green's functions learned from data (Q6101898) (← links)
• Generalized linear models for massive data via doubly-sketching (Q6117016) (← links)
• Norms of structured random matrices (Q6130287) (← links)
• Lipschitz geometry of operator spaces and Lipschitz-free operator spaces (Q6144267) (← links)
• \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\) (Q6145674) (← links)
• Fast Metric Embedding into the Hamming Cube (Q6154196) (← links)
• On randomized sketching algorithms and the Tracy-Widom law (Q6163409) (← links)
• Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)
• Sharp Analysis of Sketch-and-Project Methods via a Connection to Randomized Singular Value Decomposition (Q6202283) (← links)
• Constructing low-rank Tucker tensor approximations using generalized completion (Q6489425) (← links)