Results 1  10
of
219,514
Minwise Independent Permutations
 Journal of Computer and System Sciences
, 1998
"... We define and study the notion of minwise independent families of permutations. We say that F ⊆ Sn is minwise 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 ..."
Abstract

Cited by 276 (14 self)
 Add to MetaCart
We define and study the notion of minwise independent families of permutations. We say that F ⊆ Sn is minwise 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
Derandomized constructions of kwise (almost) independent permutations
 In Proceedings of the 9th Workshop on Randomization and Computation (RANDOM
, 2005
"... Abstract Constructions of kwise almost independent permutations have been receiving a growingamount of attention in recent years. However, unlike the case of kwise independent functions,the size of previously constructed families of such permutations is far from optimal. This paper gives a new met ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
Abstract Constructions of kwise almost independent permutations have been receiving a growingamount of attention in recent years. However, unlike the case of kwise independent functions,the size of previously constructed families of such permutations is far from optimal. This paper gives a new
Minwise independent permutations (extended abstract
 In STOC ’98: Proceedings of the thirtieth annual ACM symposium on Theory of computing
, 1998
"... We define and study the notion of minwise independent families of permutations. We say that F⊆Sn is minwise 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 ..."
Abstract

Cited by 59 (1 self)
 Add to MetaCart
We define and study the notion of minwise independent families of permutations. We say that F⊆Sn is minwise 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
Reachability Querying: An Independent Permutation Labeling Approach
"... Reachability query is a fundamental graph operation which answers whether a vertex can reach another vertex over a large directed graph G with n vertices and m edges, and has been extensively studied. In the literature, all the approaches compute a label for every vertex in a graph G by index constr ..."
Abstract
 Add to MetaCart
, and the randomness is by independent permutation. We conduct extensive experimental studies to compare with the uptodate approaches using 19 large real datasets used in the existing work and synthetic datasets. We confirm the efficiency of our approach. 1.
A Derandomization Using MinWise Independent Permutations
 In Randomization and approximation techniques in computer science
"... . Minwise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate minwise independence allows similar uses, by presenting a derando ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
. Minwise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate minwise independence allows similar uses, by presenting a
Completeness and robustness properties of minwise independent permutations
 RANDOM STRUCTURES AND ALGORITHMS
, 1999
"... We provide several new results related to the concept of minwise independence. Our main result is that any randomized sampling scheme for the relative intersection of sets based on testing equality of samples yields an equivalent minwise independent family. Thus, in a certain sense, minwise indepe ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
permutation from a minwise independent family, any element of a fixed set has an equal chance to get any rank in the image of the set, not only the minimum as required by definition.
On (ε, k)minwise independent permutations
"... A family of permutations F of [n] = {1, 2,..., n} is (ε, k)minwise independent if for every nonempty subset X of at most k elements of [n], and for any x ∈ X, the probability that in a random element π of F, π(x) is the minimum element of π(X), deviates from 1/X  by at most ε/X. This notion c ..."
Abstract
 Add to MetaCart
A family of permutations F of [n] = {1, 2,..., n} is (ε, k)minwise independent if for every nonempty subset X of at most k elements of [n], and for any x ∈ X, the probability that in a random element π of F, π(x) is the minimum element of π(X), deviates from 1/X  by at most ε/X. This notion
: www.idealibrary.com on MinWise Independent Permutations
, 1998
"... We define and study the notion of minwise independent families of permutations. We say that F Sn (the symmetric group) is minwise 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 a ..."
Abstract
 Add to MetaCart
We define and study the notion of minwise independent families of permutations. We say that F Sn (the symmetric group) is minwise 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
Constructing an Optimal Family of MinWise Independent Permutations
, 2000
"... this paper, we shallcoll[53 a familyF ..."
Low Discrepancy Sets Yield Approximate MinWise Independent Permutation Families
 In Proc. International Workshop on Randomization and Approximation Techniques in Computer Science
, 1999
"... Motivated by a problem of filtering nearduplicate Web documents, Broder, Charikar, Frieze & Mitzenmacher defined the following notion of fflapproximate minwise independent permutation families. A multiset F of permutations of f0; 1; : : : ; n \Gamma 1g is such a family if for all K ` f0; 1; : ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Motivated by a problem of filtering nearduplicate Web documents, Broder, Charikar, Frieze & Mitzenmacher defined the following notion of fflapproximate minwise independent permutation families. A multiset F of permutations of f0; 1; : : : ; n \Gamma 1g is such a family if for all K ` f0; 1
Results 1  10
of
219,514