Journal
RANDOM STRUCTURES & ALGORITHMS
Volume 22, Issue 1, Pages 60-65Publisher
WILEY
DOI: 10.1002/rsa.10073
Keywords
-
Ask authors/readers for more resources
A result of Johnson and Lindenstrauss [13] shows that a set of n points in high dimensional Euclidean space can be mapped into an O(log n/epsilon(2))-dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 +/- epsilon). In this note, we prove this theorem using elementary probabilistic techniques. (C) 2002 Wiley Periodicals. Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available