Sciweavers

565 search results - page 35 / 113
» Geometry of Upper Probabilities
Sort
View
COST
2009
Springer
95views Multimedia» more  COST 2009»
14 years 2 months ago
A Matching Algorithm Secure against the Wolf Attack in Biometric Authentication Systems
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...
Yoshihiro Kojima, Rie Shigetomi, Manabu Inuma, Aki...
GECCO
2009
Springer
14 years 2 months ago
Optimal robust expensive optimization is tractable
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
INDOCRYPT
2003
Springer
14 years 23 days ago
Stronger Security Bounds for OMAC, TMAC, and XCBC
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...
Tetsu Iwata, Kaoru Kurosawa
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
TCOM
2008
106views more  TCOM 2008»
13 years 7 months ago
Performance analysis on LDPC-Coded systems over quasi-static (MIMO) fading channels
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...
Jingqiao Zhang, Heung-No Lee