Allan Borodin, Rafail Ostrovsky, Yuval Rabani  Home/Search
Context Related
| argreenhouse.com/papers/rafail/45.ps 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: argreenhouse.com/papers/rafa...45 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In spite of extensive and continuing research, for various geometric search problems (such as nearest neighbor search), the best algorithms known have performance that degrades exponentially in the dimension. This phenomenon is sometimes called the curse of dimensionality. Recent results [33, 32, 35] show that in some sense it is possible to avoid the curse of dimensionality for the approximate nearest neighbor search problem. But must the exact nearest neighbor search problem suffer this... (Update)
Cited by: More
Hardness of String Similarity Search and Other Indexing.. - Cenk Sahinalp Andrey (Correct)
Limitations of Non-Uniform Computational Models - Chakrabarti (2002) (Correct)
Nearest Neighbors In High-Dimensional Spaces - Indyk (2004) (Correct)
Similar documents (at the sentence level):
76.1%: Lower Bounds for High Dimensional Nearest Neighbor.. - Borodin, Ostrovsky.. (1999) (Correct)
Active bibliography (related documents): More All
0.9: Tighter Lower Bounds for Nearest Neighbor Search and Related.. - Barkol, Rabani (2000) (Correct)
0.8: Nearest Neighbor Search in Multidimensional Spaces - Tsaparas (1999) (Correct)
0.7: Efficient Search for Approximate Nearest Neighbor in.. - Kushilevitz.. (1998) (Correct)
Similar documents based on text: More All
0.5: Stability Preserving Transformations: Packet Routing.. - Borodin, Ostrovsky.. (2001) (Correct)
0.5: Subquadratic Approximation Algorithms For Clustering Problems - In High Dimensional (Correct)
0.5: Approximation Algorithms for the Job Interval Selection.. - Chuzhoy, Ostrovsky (Correct)
Related documents from co-citation: More All
16: Approximate nearest neighbors: Towards removing the curse of dimensionality - Indyk, Motwani - 1998
16: A lower bound for the complexity of approximate nearest-neighbor searching on th.. - Chakrabarti, Chazelle et al. - 1999
12: Two algorithms for nearest-neighbor search in high dimensions - Kleinberg
BibTeX entry: (Update)
A. Borodin, R. Ostrovsky, Y. Rabani. Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. In Proc. of STOC, 1999. http://citeseer.ist.psu.edu/article/borodin99lower.html More
@inproceedings{ borodin99lower,
author = "Allan Borodin and Rafail Ostrovsky and Yuval Rabani",
title = "Lower bounds for high dimensional nearest neighbor search and related problems",
pages = "312--321",
year = "1999",
url = "citeseer.ist.psu.edu/article/borodin99lower.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1992
643 Query by image and video content: the QBIC system (context) - Flickner, Sawhney et al. - 1995
568 Indexing by latent semantic analysis - Deerwester, Dumais et al. - 1990
318 Automatic Text Processing (context) - Salton - 1989
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1994
243 Photobook: tools for content-based manipulation of image dat.. (context) - Pentland, Picard et al. - 1994
197 Cambridge University Press (context) - Kushilevitz, Nisan - 1997
165 Approximate nearest neighbors: Towards removing the curse of.. - Indyk, Motwani - 1998
124 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983
118 Ray shooting and parametric search (context) - Agarwal, Matousek - 1992
96 Discriminant adaptive nearest neighbor classification - Hastie, Tibshirani - 1995
91 Two algorithms for nearest-neighbor search in high dimension.. - Kleinberg - 1997
65 Should tables be sorted (context) - Yao - 1981
64 A randomized algorithm for closest-point queries (context) - Clarkson - 1988
59 Optimal numberings and isoperimetric problems on graphs (context) - Harper - 1966
58 Reporting points in halfspaces (context) - Matousek - 1991
50 Fuzzy queries in multimedia database systems - Fagin - 1998
45 An algorithm for approximate closest-point queries (context) - Clarkson - 1994
42 On data structures and asymmetric communication complexity - Miltersen, Nisan et al. - 1995
37 the analysis of indexing schemes - Hellerstein, Koutsoupias et al. - 1997
34 Partial-match retrieval algorithms (context) - Rivest - 1976
33 Approximate closest-point queries in high dimensions (context) - Bern - 1993
32 Lower bounds for union-split-find related problems on random.. - Miltersen - 1994
28 A lower bound for finding predecessors in Yao's cell probe m.. (context) - Ajtai - 1988
28 Lower bounds on the complexity of some optimal data structur.. (context) - Fredman - 1981
27 Point location in arrangements of hyperplanes (context) - Meiser - 1993
27 Approximate nearest neighbor queries revisited - Chan - 1997
24 Shape indexing using approximate nearest-neighbor search in .. - Beis, Lowe - 1997
23 New lower bounds for Hopcroft's problem - Erickson - 1996
21 New Bounds in Cell Probe Model (context) - Xiao - 1992
21 The bit probe complexity measure revisited - Miltersen - 1993
19 Algorithms and Applications (context) - de Berg, van Kreveld et al. - 1997
18 Time-space tradeoffs for branching programs - Beame, Saks et al. - 1998
17 A lower bound on the complexity of orthogonal range queries (context) - Fredman - 1981
16 On approximate nearest neighbors in non-Euclidean spaces - Indyk - 1998
15 Multidimensional search problems (context) - Dobkin, Lipton - 1976
14 Neighborhood preserving hashing and approximate queries (context) - Dolev, Harari et al. - 1994
14 the cell probe complexity of polynomial evaluation - Miltersen - 1995
11 Finding the neighborhood of a query in a dictionary - Dolev, Harari et al. - 1993
10 Approximate nearest neighbor searching (context) - Arya, Mount - 1993
8 Randomized complexity lower bounds - Grigoriev - 1998
8 A good neighbor is hard to find (context) - Chakrabarti, Chazelle et al.
7 A general approach to d-dimension geometric queries (context) - Yao, Yao - 1985
6 st Workshop on Image Databases and Multi-Media Search (context) - Smeulders, Jain et al. - 1996
6 The complexity of partial match retrieval in a dynamic setti.. (context) - Fredman, Volper - 1982
5 Private communication (context) - Chazelle
3 Efficient search for approximate neares neighbor in high dim.. (context) - Kushilevitz, Ostrovsky et al. - 1998
3 Fast algorithms for sorting and search strings (context) - Bentley, Sedgewick - 1997
The graph only includes citing articles where the year of publication is known.
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