M. Saks, A. Srinivasan, S. Zhou and D. Zuckerman. Low discrepancy sets yield approximate min-wise independent permutation families. In Proc. International Workshop on Randomization and Approximation Techniques in Computer Science, pages 11--15, 1999.  Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Low-Discrepancy Sets for High-Dimensional Rectangles: A Survey - Srinivas (Correct)
.... notion of similarity of Web documents [10] Certain constructions of such families have been developed in [16] via a connection to low discrepancy sets for geometric rectangles, di#erent constructions that have smaller size for certain ranges of the parameters of interest, have been shown in [25]. 4 Combinatorial rectangles and hitting sets This short section considers low discrepancy sets, and a related notion of hitting sets, for combinatorial rectangles. Explicit # approximations for C n m with cardinality poly(m n (1 #) O(log(1 #) were presented in [7] and were improved ....
M. Saks, A. Srinivasan, S. Zhou and D. Zuckerman. Low discrepancy sets yield approximate min-wise independent permutation families. In Proc. International Workshop on Randomization and Approximation Techniques in Computer Science, pages 11--15, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC