Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
 

Summary: Space-Time Tradeoffs for Proximity Searching
in Doubling Spaces
Sunil Arya1
, David M. Mount2
, Antoine Vigneron 3
, and Jian Xia1
1
Department of Computer Science and Engineering,
The Hong Kong University of Science and Technology,
Clear Water Bay, Kowloon, Hong Kong
{arya,piper}@cse.ust.hk
2
Department of Computer Science and Institute for Advanced Computer Studies,
University of Maryland, College Park, Maryland 20742
mount@cs.umd.edu
3
INRA, UR341 Math´ematiques et Informatique Appliqu´ees,
78352 Jouy-en-Josas, France
antoine.vigneron@jouy.inra.fr
Abstract. We consider approximate nearest neighbor searching in met-

  

Source: Arya, Sunil - Department of Computer Science, Hong Kong University of Science and Technology
Mount, David - Institute for Advanced Computer Studies & Department of Computer Science, University of Maryland at College Park
Vigneron, Antoine - Applied Mathematics and Computer Science Unit, Institut National de la Recherche Agronomique (INRA)

 

Collections: Computer Technologies and Information Sciences