Sciweavers

1559 search results - page 287 / 312
» Cooperative Communications
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
IWCMC
2010
ACM
13 years 9 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
SIGCOMM
2010
ACM
13 years 7 months ago
SourceSync: a distributed wireless architecture for exploiting sender diversity
Diversity is an intrinsic property of wireless networks. Recent years have witnessed the emergence of many distributed protocols like ExOR, MORE, SOAR, SOFT, and MIXIT that exploi...
Hariharan Rahul, Haitham Hassanieh, Dina Katabi
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 7 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
DC
2007
13 years 7 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel