Sciweavers

267 search results - page 30 / 54
» Communication Complexity Under Product and Nonproduct Distri...
Sort
View
TDSC
2011
13 years 3 months ago
RITAS: Services for Randomized Intrusion Tolerance
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
DEBS
2008
ACM
13 years 9 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
HPDC
2006
IEEE
14 years 2 months ago
Peer to peer size estimation in large and dynamic networks: A comparative study
As the size of distributed systems keeps growing, the peer to peer communication paradigm has been identified as the key to scalability. Peer to peer overlay networks are charact...
Erwan Le Merrer, Anne-Marie Kermarrec, Laurent Mas...
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 12 days ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
SIGECOM
2011
ACM
216views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
Lirong Xia, Vincent Conitzer, Jérôme ...