PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
November 19, 2002Random Structures and Algorithms965 citations

An elementary proof of a theorem of Johnson and Lindenstrauss

View Full Paper
SDSanjoy DasguptaAGAnupam Gupta

Key Points

Key points are not available for this paper at this time.

Abstract

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

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Dasgupta et al. (2002) studied this question.

synapsesocial.com/papers/6a110a87bcb015a4461a0d9ehttps://doi.org/10.1002/rsa.10073
Ask AI
Helpful
Bookmark
Share
View Full Paper