909 search results - page 123 / 182 » Games for extracting randomness |
FC
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
107
click to vote
KDD
1998
ACM
15 years 5 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
FPGA
1997
ACM
15 years 5 months ago
1997
ACM
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
COCO
2009
Springer
15 years 5 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
COLT
2008
Springer
15 years 3 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...