Sciweavers

420 search results - page 64 / 84
» Efficient Implementation of the Orlandi Protocol
Sort
View
93
Voted
FORTE
2008
15 years 1 months ago
Parameterized Tree Systems
Abstract. Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organi...
Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio De...
104
Voted
ICCCN
2007
IEEE
15 years 6 months ago
Design Techniques for Streamlined Integration and Fault Tolerance in a Distributed Sensor System for Line-crossing Recognition
Abstract — Distributed sensor system applications (e.g., wireless sensor networks) have been studied extensively in recent years. Such applications involve resource-limited embed...
Chung-Ching Shen, Roni Kupershtok, Shuvra S. Bhatt...
SENSYS
2006
ACM
15 years 6 months ago
Funneling-MAC: a localized, sink-oriented MAC for boosting fidelity in sensor networks
Sensor networks exhibit a unique funneling effect which is a product of the distinctive many-to-one, hop-by-hop traffic pattern found in sensor networks, and results in a signific...
Gahng-Seop Ahn, Se Gi Hong, Emiliano Miluzzo, Andr...
OSDI
2002
ACM
16 years 24 days ago
CMC: A Pragmatic Approach to Model Checking Real Code
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
Madanlal Musuvathi, David Y. W. Park, Andy Chou, D...
130
Voted
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
On Robust Combiners for Private Information Retrieval and Other Primitives
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
Remo Meier, Bartosz Przydatek