Approximate nearest neighbors: Towards removing the curse of dimensionality

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 604-613

  Indyk, Piotr ^a   Motwani, Rajeev ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATE NEAREST NEIGHBORS; LOCALITY-SENSITIVE HASHING;

COMPUTATIONAL COMPLEXITY;

EID: 0031644241     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (64)