On approximate nearest neighbors in non-Euclidean spaces

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1998, Pages 148-155

  Indyk, Piotr ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL MODELS; PROBLEM SOLVING;

NEAREST NEIGHBOR SEARCH (NNS) PROBLEM;

COMPUTATIONAL GEOMETRY;

EID: 0032311532     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)