DMCA
Min-wise Independent Permutations (1998)
Cached
Download Links
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [theory.stanford.edu]
- [www.aladdin.cs.cmu.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.princeton.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- [www.eecs.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Computer and System Sciences |
| Citations: | 273 - 13 self |
BibTeX
@ARTICLE{Broder98min-wiseindependent,
author = {Andrei Z. Broder and Moses Charikar and Alan M. Frieze and Michael Mitzenmacher},
title = {Min-wise Independent Permutations},
journal = {Journal of Computer and System Sciences},
year = {1998},
volume = {60},
pages = {327--336}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We define and study the notion of min-wise independent families of permutations. We say that F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr(min{π(X)} = π(x)) = 1 |X |. In other words we require that all the elements of any fixed set X have an equal chance to become the minimum element of the image of X under π. Our research was motivated by the fact that such a family (under some relaxations) is essential to the algorithm used in practice by the AltaVista web index software to detect and filter near-duplicate documents. However, in the course of our investigation we have discovered interesting and challenging theoretical questions related to this concept – we present the solutions to some of them and we list the rest as open problems.
