Sciweavers

273 search results - page 27 / 55
» Ranking of ACM SIGCOMM computer communication review
Sort
View
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 10 days ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 9 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
13 years 11 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
SIGCOMM
2012
ACM
11 years 9 months ago
CarSpeak: a content-centric network for autonomous driving
This paper introduces CarSpeak, a communication system for autonomous driving. CarSpeak enables a car to query and access sensory information captured by other cars in a manner si...
Swarun Kumar, Lixin Shi, Nabeel Ahmed, Stephanie G...
SIGCOMM
2012
ACM
11 years 9 months ago
Network-aware service placement in a distributed cloud environment
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
Moritz Steiner, Bob Gaglianello Gaglianello, Vijay...