91 search results - page 5 / 19 » Weak Composite Diffie-Hellman |
JLP
2011
12 years 10 months ago
2011
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
COLT
2001
Springer
14 years 7 hour ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
ECMDAFA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The use of Feature Models (FMs) to define the valid combinations of features in Software Product Lines (SPL) is becoming commonplace. To enhance the scalability of FMs, ...
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
CBSE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...