Sciweavers

24 search results - page 3 / 5
» Communication complexity of common voting rules
Sort
View
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 1 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
FOCS
2002
IEEE
15 years 2 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 2 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
ACL
1998
14 years 11 months ago
Reference Resolution beyond Coreference: a Conceptual Frame and its Application
A model for reference use in communication is proposed, from a representationist point of view. Both the sender and the receiver of a message handle representations of their commo...
Andrei Popescu-Belis, Isabelle Robba, Gérar...
SPAA
2010
ACM
15 years 2 months ago
Securing every bit: authenticated broadcast in radio networks
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Zark...