A Note on Rabin's Nearest-Neighbor Algorithm
| dc.contributor.author | Fortune, Steven | en_US |
| dc.contributor.author | Hopcroft, John E. | en_US |
| dc.date.accessioned | 2007-04-23T18:21:32Z | |
| dc.date.available | 2007-04-23T18:21:32Z | |
| dc.date.issued | 1978-04 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 357437 bytes | |
| dc.format.extent | 144787 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-340 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7460 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Note on Rabin's Nearest-Neighbor Algorithm | en_US |
| dc.type | technical report | en_US |