de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44561

Hagedoorn,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Hagedoorn, M. (2003). Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size. In Database Theory - ICDT 2003: 9th International Conference (pp. 440-454). New York, USA: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2D82-4
Abstract
There is no abstract available