2434 search results - page 169 / 487 » Algorithmic Randomness of Closed Sets |
124
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
153
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
104
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
112
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
106
click to vote
ECML
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...