Sciweavers

4616 search results - page 381 / 924
» The Communication Complexity of Correlation
Sort
View
INFOCOM
2002
IEEE
16 years 16 days ago
Fast PDA Synchronization Using Characteristic Polynomial Interpolation
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
Ari Trachtenberg, David Starobinski, Sachin Agarwa...
INFOCOM
1997
IEEE
15 years 11 months ago
Analyzing Non-Determinism in Telecommunication Services Using P-Invariant of Petri-Net Model
The non-deterministic behaviors in telecommunication services are well-known as one of the most typical Feature Interactions, and they should be detected and eliminated from the t...
Masahide Nakamura, Yoshiaki Kakuda, Tohru Kikuno
PVM
2000
Springer
15 years 11 months ago
Runtime Checking of Datatype Signatures in MPI
Abstract. The MPI standard provides a way to send and receive complex combinations of datatypes (e.g., integers and doubles) with a single communication operation. The MPI standard...
William Gropp
ICISC
2008
126views Cryptology» more  ICISC 2008»
15 years 9 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
GLOBECOM
2010
IEEE
15 years 5 months ago
Maximization of Data Gathering in Clustered Wireless Sensor Networks
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...