993 search results - page 160 / 199 » The Complexity of Probabilistic EL |
CRYPTO
2006
Springer
14 years 21 days ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
CAV
2001
Springer
14 years 18 days ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
INFOCOM
1995
IEEE
14 years 15 days ago
1995
IEEE
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
AAAI
2008
13 years 11 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
MOBISYS
2007
ACM
13 years 11 months ago
2007
ACM
— Perhaps the most significant challenge in design of on-body sensors is the wearability concern. This concern requires that the size of the nodes (sensors, processing units and ...