6142 search results - page 536 / 1229 » The Complexity of Partition Functions |
203
click to vote
INDOCRYPT
2005
Springer
16 years 16 days ago
2005
Springer
1 Dragon is a word oriented stream cipher submitted to the ECRYPT project, it operates on key sizes of 128 and 256 bits. The original idea of the design is to use a nonlinear feedb...
208
click to vote
ICML
2004
IEEE
16 years 14 days ago
2004
IEEE
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
160
click to vote
WECWIS
2003
IEEE
16 years 9 days ago
2003
IEEE
Agent negotiation over multiple issues is often seen as the process of searching for a solution in a complex and large space. Depending on the negotiation mechanism such search sp...
199
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
215
click to vote
SAFECOMP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. This paper introduces a new method for safety analysis called HiPHOPS (Hierarchically Performed Hazard Origin and Propagation Studies). HiP-HOPS originates from a number ...