Sciweavers

1497 search results - page 167 / 300
» A Computational Model for Message Passing
Sort
View
EUROPAR
2007
Springer
14 years 2 months ago
Modeling and Validating the Performance of Atomic Broadcast Algorithms in High Latency Networks
Abstract. The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the ...
Richard Ekwall, André Schiper
CRYPTO
2005
Springer
72views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Unconditional Characterizations of Non-interactive Zero-Knowledge
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...
Rafael Pass, Abhi Shelat
FCT
1997
Springer
14 years 11 days ago
Trade-Off Results for Connection Management
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
Marios Mavronicolas, Nikos Papadakis
PODC
2010
ACM
14 years 3 days ago
Brief announcement: asynchronous bounded expected delay networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
IPSN
2007
Springer
14 years 2 months ago
Robust message-passing for statistical inference in sensor networks
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
Jeremy Schiff, Dominic Antonelli, Alexandros G. Di...