Sciweavers

2814 search results - page 35 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
14 years 10 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
ICASSP
2010
IEEE
13 years 10 months ago
Convergence analysis of consensus-based distributed clustering
This paper deals with clustering of spatially distributed data using wireless sensor networks. A distributed low-complexity clustering algorithm is developed that requires one-hop...
Pedro A. Forero, Alfonso Cano, Georgios B. Giannak...
SCALESPACE
1999
Springer
14 years 2 months ago
Fast Marching to Moving Object Location
In this paper we address two important problems in motion analysis: the detection of moving objects and their localization. Statistical and level set approaches are adopted in orde...
Eftychios Sifakis, George Tziritas
INFOCOM
2005
IEEE
14 years 3 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
KES
2006
Springer
13 years 9 months ago
A Framework for distributed knowledge management in autonomous logistic processes
The trends and recent changes in logistics lead to complex and partially conflicting requirements on logistic planning and control systems. Due to the lack of efficiency of curren...
Hagen Langer, Jan D. Gehrke, Joachim Hammer, Marti...