College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||A Note on Rabin's Nearest-Neighbor Algorithm|
|Authors: ||Fortune, Steven|
Hopcroft, John E.
|Keywords: ||computer science|
|Issue Date: ||Apr-1978|
|Publisher: ||Cornell University|
|Abstract: ||Rabin has proposed a probabilistic algorithm for finding the closest pair of a set of points in Euclidean space. His algorithm is asymtomatically linear whereas the best of the known deterministic algorithms take order $n \log n$ time. We show that at least part of the speed up is due to the model rather than the probabilistic nature of the algorithm.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.