2184 search results - page 42 / 437 » Relative Entropy and Statistics |
115
click to vote
EUROCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
105
click to vote
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
There have been active discussions on how to derive a consistent cryptographic key from noisy data such as biometric templates, with the help of some extra information called a ske...
106
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Recently, boosting is used widely in object detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifiers which is on...
91
Voted
ALT
2008
Springer
15 years 9 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
93
Voted
DCC
2004
IEEE
16 years 8 hour ago
2004
IEEE
Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high? performance encoding is needed. ...