The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

SIAM Journal on Computing- United States

doi 10.1137/060673096

Full Text

Abstract

Available in

Categories

Computer Science

Date

January 1, 2009

Authors

Bernard Chazelle

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

The Johnson-Lindenstrauss Transform: An Empirical Study

English

Randomized Approximate Nearest Neighbors Algorithm

Proceedings of the National Academy of Sciences of the United States of America

Multidisciplinary

English

A Randomized Approximate Nearest Neighbors Algorithm

Applied and Computational Harmonic Analysis

Applied Mathematics

English

Dimensionality Reduction: Beyond the Johnson-Lindenstrauss Bound

English

Almost Optimal Explicit Johnson-Lindenstrauss Families

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Fast Approximate Complete-Data K-Nearest-Neighbor Estimation

Austrian Journal of Statistics

Applied Mathematics

English

Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions

English

The Johnson-Lindenstrauss Lemma Almost Characterizes Hilbert Space, but Not Quite

English

Introduction to Machine Learning: K-Nearest Neighbors

Annals of Translational Medicine

English