Key points are not available for this paper at this time.
Abstract 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/ϵ 2 )‐dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 ± ϵ). In this note, we prove this theorem using elementary probabilistic techniques. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 22: 60–65, 2002
Building similarity graph...
Analyzing shared references across papers
Loading...
Dasgupta et al. (Tue,) studied this question.
www.synapsesocial.com/papers/6a110a87bcb015a4461a0d9e — DOI: https://doi.org/10.1002/rsa.10073
Sanjoy Dasgupta
Anupam Gupta
Random Structures and Algorithms
AT&T (United States)
Nokia (United States)
Alcatel Lucent (Germany)
Building similarity graph...
Analyzing shared references across papers
Loading...