Sciweavers

1920 search results - page 302 / 384
» The Complexity of the A B C Problem
Sort
View
ATAL
2010
Springer
13 years 10 months ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
MOBICOM
2010
ACM
13 years 9 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
FOCM
2008
100views more  FOCM 2008»
13 years 8 months ago
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
Felipe Alvarez, Jérôme Bolte, Julien ...
DAM
2007
107views more  DAM 2007»
13 years 8 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
CCR
2005
131views more  CCR 2005»
13 years 8 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...