Sciweavers

91 search results - page 16 / 19
» Multiparty Communication Complexity of Disjointness
Sort
View
JDM
1998
101views more  JDM 1998»
13 years 7 months ago
Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems
We propose a new replication control scheme for multiple-copy consistency in mobile distributed database systems. Replicating data at multiple sites could contribute to enhance th...
Siwoo Byun, Songchun Moon
GLOBECOM
2009
IEEE
14 years 2 months ago
A Decentralized Framework for Dynamic Downlink Base Station Cooperation
— Multiple Base Station (Multi-BS) cooperation has been considered as a promising mechanism to suppress cochannel interference and boost the capacity for cellular networks. Howev...
Sheng Zhou, Jie Gong, Zhisheng Niu, Yunjian Jia, P...
FOCS
2003
IEEE
14 years 25 days ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai