On the Efficient Determination of Most Near Neighbors
Horseshoes, Hand Grenades, Web Search, and Other Situations When Close Is Close Enough Second Edition
Page
%P
-
Reference Work Entry In depth
Ski Rental Problem
-
Chapter
Afterword
Thanks for persisting with this mixed bag of algorithms, mathematical curiosities, and algorithms engineering. I mean this in the best spirit of the HAKMEM collection of similar oddities from the MIT AI lab fo...
-
Chapter
Introduction
-
Chapter
Why Weight (and How)?
The sampling mechanisms described in the previous sections provide unbiased estimators of the standard unweighted Jaccard coefficient, in which all features are treated as being equally important. But some fea...
-
Chapter
Forks in the Road: Flajolet and Slightly Biased Sampling
As mentioned in the Forward (sic, as described on page xv), shortly after the initial version of this publication was placed in the hands of my publisher, I received a disconcerting preprint from ** Li: he a...
-
Chapter
Comparing Web Pages for Similarity: An Overview
When comparing pages in a corpus, there are some things one has to consider (which we do in the following sections).
-
What are the features of ...
-
-
Chapter
Uniform Sampling after Alta Vista
In the 15 years since we worked on Alta Vista (while applying these techniques to Bing, and subsequently) , we have discovered a few ways to compute consistent random samples from streams, typically using fewe...
-
Chapter
A Few Applications
In this chapter, we look, or in some cases look yet again, at a few of the applications we have made of these and other sampling techniques.
-
Chapter
A Personal History of Web Search
In 1995, just prior to public release, we discovered a problem with the Alta Vista search engine: most of the time searching worked just fine, but sometimes the results were highly repetitive. We knew that the...
-
Book
-
Living Reference Work Entry In depth
Ski Rental Problem
-
Chapter
Comparing Web Pages for Similarity: An Overview
When comparing pages in a corpus, there are some things one has to consider (which we do in the following sections):
-
What are the features of ...
-
-
Chapter
Uniform Sampling after Alta Vista
In the fifteen years since we worked on Alta Vista (while applying these techniques to Bing, and subsequently), we have discovered a few ways to compute consistent random samples from streams, typically using ...
-
Chapter
A Few Applications
In this chapter, we look, or in some cases look yet again, at a few of the applications we have made of these and other sampling techniques.
-
Chapter
Introduction
-
Chapter
Why Weight (and How)?
The sampling mechanisms described in the previous sections provide unbiased estimators of the standard unweighted Jaccard coefficient, in which all features are treated as being equally important. But some fea...
-
Book
On The Efficient Determination of Most Near Neighbors
Horseshoes, Hand Grenades,Web Search, and Other SituationsWhen Close is Close Enough
-
Chapter
A Personal History of Web Search
In 1995, just prior to public release, we discovered a problem with the Alta Vista search engine: most of the time searching worked just fine, but sometimes the results were highly repetitive. We knew that the...
-
Reference Work Entry In depth
Ski Rental Problem
-
Chapter and Conference Paper
Factoring with two large primes
The study of integer factoring algorithms and the design of faster factoring algorithms is a subject of great importance in cryptology (cf. [1]), and a constant concern for cryptographers. In this paper we presen...
