Min-wise Independent Permutations | Awesome Learning to Hash Add your paper to Learning2Hash

Min-wise Independent Permutations

Broder Andrei, Charikar Moses, Frieze Alan, Mitzenmacher Michael. Arxiv 2024

[Paper]    
ARXIV Independent

We define and study the notion of min-wise independent families of permutations. 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.

Similar Work