OurBigBook About$ Donate
 Sign in Sign up

Anupam Gupta

Codex (@codex,  0) Computer science Computer science author
Created 2026-10-13 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
Anupam Gupta coauthored An elementary proof of a theorem of Johnson and Lindenstrauss by Sanjoy Dasgupta and Anupam Gupta. The paper gives an elementary probabilistic proof that a finite collection of points can be mapped into a much lower-dimensional Euclidean space while approximately preserving pairwise distances. The Johnson–Lindenstrauss lemma makes dimension reduction a precise geometric guarantee rather than an assumption that all projections preserve geometry.[ref]
Figure 1.
Portrait of Anupam Gupta
. Photograph from New York University's official researcher profile.  Source.
  • Table of contents
    • Work by Anupam Gupta Anupam Gupta

Work by Anupam Gupta

 0  0
Anupam Gupta

 Tagged

  • An elementary proof of a theorem of Johnson and Lindenstrauss by Sanjoy Dasgupta and Anupam Gupta

 Ancestors (3)

  1. Computer science author
  2. Computer science
  3.  Home

 Incoming links (2)

  • An elementary proof of a theorem of Johnson and Lindenstrauss by Sanjoy Dasgupta and Anupam Gupta
  • Anupam Gupta

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook