Peter Braß, Christian Knauer  Home/Search
Context
Related
| inf.fuberlin.de/ins...trb0110.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: inf.fuberlin.d...[showYear]=2001 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We devise the rst data structure that, with a sucient amount of preprocessing, answers nearest-neigbour queries among point patterns in d{dimensional Euclidean space with respect to (various variants of) the Hausdor distance in near-optimal O(m log n) time, if the query set consists of m points and the preprocessed patterns contain a total of n points. (Update)
Similar documents (at the sentence level):
6.2%: Nearest Neighbour Search in Hausdorff Distance Pattern Spaces - Braß, Knauer (2001) (Correct)
Active bibliography (related documents): More All
0.5: Nearest Neighbors In High-Dimensional Spaces - Indyk (2004) (Correct)
0.2: Testing the LAESA Algorithm in Handwritten Character.. - Gómez, Micó, Oncina (Correct)
0.2: A Fast Branch & Bound Nearest Neighbour Classifier in.. - Micó, Oncina, Carrasco (1996) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ bra-nearest,
author = "Peter Braß and Christian Knauer",
title = "Nearest Neighbour Search in Hausdorff Distance Pattern Spaces",
url = "citeseer.ist.psu.edu/742252.html" }
Citations (may not include all citations):165 Approximate nearest neighbors: Towards removing the curse of.. - Indyk, Motwani - 1998
85 Data structures and algorithms for nearest neighbor search i.. - Yianilos - 1993
78 Near neighbor search in large metric spaces - Brin - 1995
58 A simple algorithm for nearest neighbor search in high dimen.. - Nene, Nayar - 1997
53 Nearest neighbor queries in metric spaces (context) - Clarkson - 1997
44 Communications of the ACM (context) - Fredkin - 1960
39 Discrete geometric shapes: Matching (context) - Alt, Guibas - 2000
36 Voronoi diagrams - Aurenhammer, Klein - 2000
22 Geometric pattern matching in d-dimensional space - Chew, Dor et al. - 1995
20 Searching in metric spaces - Ch, Navarro et al. - 1999
18 Excluded middle vantage point forests for nearest neighbor s.. - Yianilos - 1999
14 The nearest neighbor problem in an abstract metric space (context) - Feustel, Shapiro - 1982
4 New formulation and improvements of the nearest-neigbour app.. (context) - Vidal - 1994
4 nearest neighbor search in high dimensions (context) - Alt, Heinrich-Litan - 2001
2 Fachbereich Mathematik und Informatik (context) - Alt, Brass et al. - 2001
2 Some metric properties of hyperspaces (context) - Bogdewicz - 2000
Documents on the same site (http://www.inf.fu-berlin.de/inst/ag-ti/members/index.php?id=29&no_cache=1&L=1&tx_tipublications_pi1[showYear]=2001): More
Fast 2-Variable Integer Programming - Eisenbrand, Rote (2001) (Correct)
Expansive Motions and the Polytope of Pointed.. - Rote, Santos, Streinu (2001) (Correct)
Covering with Ellipses - Efrat, Hoffmann, Knauer, Kriegel.. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC