Sciweavers

254 search results - page 34 / 51
» On randomized one-round communication complexity
Sort
View
ICC
2007
IEEE
303views Communications» more  ICC 2007»
14 years 2 months ago
Diversity and Multiplexing in Cooperative Wireless Cellular Networks
Abstract— In wireless cellular systems, capacity can be increased if both in-cell and out-of-cell cochannel interference (CCI) is properly handled. Moreover, spatial multiplexing...
Diego Piazza, Guido Tartara
INFOCOM
2007
IEEE
14 years 1 months ago
Shape Segmentation and Applications in Sensor Networks
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
Xianjin Zhu, Rik Sarkar, Jie Gao
NCA
2007
IEEE
14 years 1 months ago
A Topological Analysis of Monitor Placement
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
Alden W. Jackson, Walter C. Milliken, Cesar A. San...
MDM
2007
Springer
14 years 1 months ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
PKC
2007
Springer
125views Cryptology» more  PKC 2007»
14 years 1 months ago
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Takashi Nishide, Kazuo Ohta