Sciweavers

4795 search results - page 776 / 959
» The Message Classification Model
Sort
View
PVM
2010
Springer
15 years 27 days ago
Communication Target Selection for Replicated MPI Processes
Abstract. VolpexMPI is an MPI library designed for volunteer computing environments. In order to cope with the fundamental unreliability of these environments, VolpexMPI deploys tw...
Rakhi Anand, Edgar Gabriel, Jaspal Subhlok
118
Voted
SCN
2010
Springer
145views Communications» more  SCN 2010»
15 years 27 days ago
Distributed Private-Key Generators for Identity-Based Cryptography
An identity-based encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages. However, an IBE scheme necessarily requires a private-key generator (PKG)...
Aniket Kate, Ian Goldberg
104
Voted
IFIPTCS
2010
15 years 13 days ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
ICASSP
2009
IEEE
15 years 8 days ago
Robust joint localization and time synchronization in wireless sensor networks with bounded anchor uncertainties
A unified framework to jointly solve the two problems of localization and synchronization at the same time is presented in this paper. The joint approach is attractive because it ...
Jun Zheng, Yik-Chung Wu
108
Voted
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 9 months ago
Beating the Gilbert-Varshamov Bound for Online Channels
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
Ishay Haviv, Michael Langberg