1898 search results - page 79 / 380 » Weak Keys for IDEA |
121
Voted
ECML
2007
Springer
15 years 7 months ago
2007
Springer
Class binarizations are effective methods for improving weak learners by decomposing multi-class problems into several two-class problems. This paper analyzes how these methods can...
127
Voted
HYBRID
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
117
Voted
ICB
2007
Springer
15 years 7 months ago
2007
Springer
Performance of biometric systems is dependent on quality of acquired biometric samples. Poor sample quality is a main reason for matching errors in biometric systems and may be the...
154
Voted
EUROCRYPT
2006
Springer
15 years 7 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
172
Voted
FOSSACS
2006
Springer
15 years 7 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...