Sciweavers

7213 search results - page 115 / 1443
» Automated model grouping
Sort
View
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
15 years 2 months ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
AAECC
2007
Springer
88views Algorithms» more  AAECC 2007»
14 years 10 months ago
Hyperelliptic curves with reduced automorphism group A5
We study genus g hyperelliptic curves with reduced automorphism group A5 and give equations y2 = f(x) for such curves in both cases where f(x) is a decomposable polynomial in x2 or...
David Sevilla, Tanush Shaska
CLASSIFICATION
2010
14 years 7 months ago
A Formal Proof of a Paradox Associated with Cohen's Kappa
Abstract: Suppose two judges each classify a group of objects into one of several nominal categories. It has been observed in the literature that, for fixed observed agreement betw...
Matthijs J. Warrens
DAC
2004
ACM
15 years 11 months ago
Abstraction refinement by controllability and cooperativeness analysis
ion Refinement by Controllability and Cooperativeness Analysis Freddy Y.C. Mang and Pei-Hsin Ho Advanced Technology Group, Synopsys, Inc. {fmang, pho}@synopsys.com nt a new abstrac...
Freddy Y. C. Mang, Pei-Hsin Ho
OTM
2009
Springer
15 years 4 months ago
Revisiting the Behavior of Fault and Compensation Handlers in WS-BPEL
When automating work, it is often desirable to compensate completed work by undoing the work done by one or more activities. In the context of workflow, where compensation actions...
Rania Khalaf, Dieter Roller, Frank Leymann