Sciweavers

3991 search results - page 723 / 799
» Bounding homogeneous models
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
ISCC
2006
IEEE
188views Communications» more  ISCC 2006»
14 years 1 months ago
Active Learning Driven Data Acquisition for Sensor Networks
Online monitoring of a physical phenomenon over a geographical area is a popular application of sensor networks. Networks representative of this class of applications are typicall...
Anish Muttreja, Anand Raghunathan, Srivaths Ravi, ...
ICDCS
2005
IEEE
14 years 1 months ago
Controlling Gossip Protocol Infection Pattern Using Adaptive Fanout
We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of go...
Satish Verma, Wei Tsang Ooi
PODC
2005
ACM
14 years 1 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 23 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman