Campus Event Calendar
Event Entry
What and Who
Nearest neighbour searching in metric spaces
Michiel Hagedoorn
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (others' work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 17 November 2000
13:30
30 Minutes
MPI
024
Saarbrücken
Abstract
Nearest neighbour searching (NNS) problems have been receiving a lot
of attention from computational geometers during the last ten years.
An optimal algorithm has been found for the approximate NNS problem
in finite-dimensional Euclidean space (R^d).
In addition, results are starting to appear for the NNS problem
in metric spaces other than R^d.
Results of this type may lead to faster methods for content-based
image retrieval.
Contact
Michiel Hagedoorn
+49 681 9325 128
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
nearest neighbour; metric spaces; image retrieval; computational geometry