An elementary proof of a theorem of Johnson and Lindenstrauss
Top Cited Papers
- 25 November 2002
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 22 (1), 60-65
- https://doi.org/10.1002/rsa.10073
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Algorithmic derandomization via complexity theoryPublished by Association for Computing Machinery (ACM) ,2002
- Database-friendly random projectionsPublished by Association for Computing Machinery (ACM) ,2001
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Some geometric applications of the beta distributionAnnals of the Institute of Statistical Mathematics, 1990
- The Johnson-Lindenstrauss lemma and the sphericity of some graphsJournal of Combinatorial Theory, Series B, 1988
- Extensions of Lipschitz mappings into a Hilbert spacePublished by American Mathematical Society (AMS) ,1984
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952