Sciweavers

1286 search results - page 44 / 258
» A Practical Modelling Notation for Secure Distributed Comput...
Sort
View
JHSN
2006
267views more  JHSN 2006»
15 years 3 months ago
Client-side access control enforcement using trusted computing and PEI models
It has been recognized for some time that software alone does not provide an adequate foundation for building a high-assurance trusted platform. The emergence of industry-standard ...
Ravi S. Sandhu, Xinwen Zhang, Kumar Ranganathan, M...
JPDC
2006
134views more  JPDC 2006»
15 years 3 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
SCN
2010
Springer
122views Communications» more  SCN 2010»
15 years 1 months ago
A New Security Model for Authenticated Key Agreement
The Canetti–Krawczyk (CK) and extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for key agreement protocols. We discuss security s...
Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Cla...
DIS
2007
Springer
15 years 9 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki
AAI
2006
126views more  AAI 2006»
15 years 3 months ago
Theory and practice of field-based motion coordination in multiagent systems
Enabling and managing coordination activities between autonomous, possibly mobile, computing entities in dynamic computing scenarios challenges traditional approaches to distribut...
Marco Mamei, Franco Zambonelli