1898 search results - page 79 / 380 » Weak Keys for IDEA |
ECML
2007
Springer
14 years 21 days 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...
HYBRID
2007
Springer
14 years 20 days 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...
ICB
2007
Springer
14 years 20 days 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...
EUROCRYPT
2006
Springer
14 years 13 days 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...
FOSSACS
2006
Springer
14 years 13 days 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...