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

Hagedoorn, Michiel; Calvanese, Diego; Lenzerini, Maurizio; Motwani, Rajeev

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2D82-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2D85-D

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Hagedoorn, Michiel¹, Author
Calvanese, Diego, Editor
Lenzerini, Maurizio, Editor
Motwani, Rajeev, Editor

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2004-06-17Date issued: 2003

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 201863
Other: Local-ID: C1256428004B93B8-244F00DC9AEB81ADC1256CAF005D7C9F-Hagedoorn2003:nncbfe

Degree: -

Event

show

hide

Title: ICDT 2003

Place of Event: Siena, Italy

Start-/End Date: 2003-01-08 - 2003-01-10

Legal Case

show

Project information

show

Source 1

show

hide

Title: Database Theory - ICDT 2003 : 9th International Conference

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, USA : Springer

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 440 - 454 Identifier: ISBN: 3-540-00323-1

Source 2

show

hide

Title: Lecture Notes in Computer Science

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 2572 Sequence Number: - Start / End Page: - Identifier: -