Sciweavers

44 search results - page 8 / 9
» Exact Quantum Algorithms for the Leader Election Problem
Sort
View
COCO
2008
Springer
108views Algorithms» more  COCO 2008»
13 years 7 months ago
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
Dmitry Gavinsky, Pavel Pudlák
SIGCOMM
2005
ACM
13 years 11 months ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
CDC
2010
IEEE
115views Control Systems» more  CDC 2010»
13 years 24 days ago
Distributed statistical estimation of the number of nodes in sensor networks
The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the foll...
Damiano Varagnolo, Gianluigi Pillonetto, Luca Sche...
SPAA
2005
ACM
13 years 11 months ago
Constant density spanners for wireless ad-hoc networks
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
Kishore Kothapalli, Christian Scheideler, Melih On...
WINE
2009
Springer
93views Economy» more  WINE 2009»
14 years 11 days ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...