1510 search results - page 44 / 302 » Upper Probabilities and Additivity |
COST
2009
Springer
14 years 5 months ago
2009
Springer
We propose a matching algorithm secure against the wolf attack in one-to-one biometric authentications. Our proposal algorithm first executes a one-to-all comparison using a conve...
GECCO
2009
Springer
14 years 5 months ago
2009
Springer
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
INDOCRYPT
2003
Springer
14 years 4 months ago
2003
Springer
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure for arbitrary message length. In this paper, we present a more tight upper bound on Advmac for each scheme, w...
JMLR
2008
13 years 11 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
TCOM
2008
13 years 11 months ago
2008
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...