David R. Karger, Matthias Ruhl  Home/Search
Context Related
| mit.edu/chord/papers/2002stoc.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: mit.edu/chord/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Euclidean. Nearest neighbor algorithms for general metric spaces are quite weak, which motivates a search for other classes of metric spaces that can be tractably searched. (Update)
Cited by: More
On Name Resolution in Peer-to-Peer Networks - Xiaozhou Li Greg (Correct)
A Note on the Nearest Neighbor in Growth-Restricted Metrics - Kirsten Hildrum John (Correct)
OASIS: Anycast for Any Service - Michael Freedman Karthik (2006) (Correct)
Active bibliography (related documents): More All
0.2: Automated Modeling and Nonlinear Axis Scaling - Leejay Wu (2005) (Correct)
0.1: Searching in Metric Spaces by Spatial Approximation - Navarro (1999) (Correct)
0.1: Shock-based Indexing into Large Shape Databases - Sebastian, Klein, Kimia (2002) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Parallel Processor Scheduling with Delay Constraints - Engels, Feldman, Karger, Ruhl (2001) (Correct)
0.2: Anonymous Subscription Protocols - Ramzan, Ruhl (2000) (Correct)
0.1: Finding Maximum Flows in Undirected Graphs Seems Easier than.. - Karger, Levine (1997) (Correct)
Related documents from co-citation: More All
28: Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaram et al. - 1997
16: distributed object location and routing for large-scale peer-to-peer systems (context) - Rowstron, Druschel et al. - 2001
13: Exploiting network proximity in peer-to-peer overlay networks (context) - Hu, Rowstron et al.
BibTeX entry: (Update)
D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pages 63--66, 2002. http://citeseer.ist.psu.edu/karger02finding.html More
@misc{ karger02finding,
author = "D. Karger and M. Ruhl",
title = "Finding nearest neighbors in growth-restricted metrics",
text = "D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics.
In Proceedings of the 34th Annual ACM Symposium on the Theory of Computing,
pages 63--66, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/karger02finding.html" }
Citations (may not include all citations):1225 Chord: A scalable peer-to-peer lookup service for internet a.. - Stoica, Morris et al. - 2001
346 Multidimensional binary search trees used for associative se.. (context) - Bentley - 1975
282 Accessing nearby copies of replicated objects in a distribut.. - Plaxton, Rajaraman et al. - 1999
184 A global geometric framework for nonlinear dimensionality re.. (context) - Tenenbaum, de Silva et al. - 2000
85 Data structures and algorithms for nearest neighbor search i.. - Yianilos - 1993
78 Near neighbor search in large metric spaces - Brin - 1995
69 Optimal expected-time algorithms for closest point problems (context) - Bentley, Weide et al. - 1980
53 Nearest neighbor queries in metric spaces (context) - Clarkson - 1999
29 Satisfying general proximitysimilarity querie with metric tr.. (context) - general, queries et al. - 1991
21 Searching in metric spaces (context) - Chavez, Navarro et al. - 2001
14 Mapping a manifold of perceptual observations - Tenenbaum - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pdos.lcs.mit.edu/chord/): More
Observations on the Dynamic Evolution of Peer-to-Peer.. - Liben-Nowell.. (2002) (Correct)
Security Considerations for Peer-to-Peer Distributed Hash Tables - Sit, Morris (2002) (Correct)
Chord: A Scalable Peer-to-peer Lookup Service for.. - Stoica, Morris.. (2002) (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