391 search results - page 24 / 79 » Constructive Equivalence Relations on Computable Probability... |
CRYPTO
2007
Springer
15 years 5 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
ICPR
2004
IEEE
16 years 13 days ago
2004
IEEE
In this paper we describe two related approaches to estimating the sample sizes required to statistically compare the performance of two classifiers: acceptable failure rates (AFR...
FCT
2003
Springer
15 years 4 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...
102
click to vote
TSMC
2010
14 years 6 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
QEST
2008
IEEE
15 years 5 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...