A General Construction of Min-Wise Independent Permutations(Special Section on Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
A min-wise independent permutation family is known to be an efficient tool to estimate similarity of documents. Toward good understanding of min-wise independence, we present a characterization of exactly min-wise independent permutation families by size uniformity, which represents certain symmetry of the string representation of a family. Also, we present a general construction strategy which produce any exactly min-wise independent permutation family using this characterization.
- 社団法人電子情報通信学会の論文
- 2000-04-25
著者
-
Takei Yoshinori
The Author Is With The Department Of Electrical And Electronic Engineering Tokyo Institute Of Techno
-
ITOH Toshiya
The author is with the Department of Information Processing, Tokyo Institute of Technology
-
Itoh Toshiya
The Author Is With Global Scientific Information And Computing Center (gsic) Tokyo Institute Of Tech
-
Itoh Toshiya
The Author Is With The Department Of Information Processing Tokyo Institute Of Technology
関連論文
- A General Construction of Min-Wise Independent Permutations(Special Section on Discrete Mathematics and Its Applications)
- Constructing an Optimal Family of Min-Wise Independent Permutations
- Min-Wise Independence vs. 3-Wise Independence(Special Section on Discrete Mathematics and Its Applications)
- Approximating the Maximum Weight of Linear Codes is APX-Complete(Special Section on Discrete Mathematics and Its Applications)
- On Lower Bounds for the Communication Complexity of Private Information Retrieval : Special Section on Cryptography and Information Security