scientific article; zbMATH DE number 2119731
From MaRDI portal
Publication:4829005
zbMATH Open1093.68668MaRDI QIDQ4829005FDOQ4829005
Piotr Indyk, Ryan O'Donnell, Lars Engebretsen
Publication date: 29 November 2004
Title of this publication is not available (Why is that?)
Recommendations
- Algorithms and Data Structures
- Universality laws for randomized dimension reduction, with applications
- Randomized large distortion dimension reduction
- Explicit dimension reduction and its applications
- scientific article; zbMATH DE number 6860845
- Entropy dimension reduction method for randomized machine learning problems
- Dimensionality reduction: beyond the Johnson-Lindenstrauss bound
- A New Approach to Dimensionality Reduction: Theory and Algorithms
- Stochastic approximation approaches of large-scale matrix dimension reduction
- scientific article; zbMATH DE number 5263135
Cited In (15)
- Title not available (Why is that?)
- A variant of the Johnson-Lindenstrauss lemma for circulant matrices
- Feasibility of DEIM for retrieving the initial field via dimensionality reduction
- A polynomial time approximation scheme for computing the supremum of Gaussian processes
- Using Randomization to Break the Curse of Dimensionality
- Entropy dimension reduction method for randomized machine learning problems
- Holographic phenomenology via overlapping degrees of freedom
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Title not available (Why is that?)
- A New Approach to Dimensionality Reduction: Theory and Algorithms
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Deterministic parallel algorithms for bilinear objective functions
- Dimensionality reduction of SDPs through sketching
- Deterministic discrepancy minimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829005)
