Sciweavers

2814 search results - page 56 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
PODC
2010
ACM
14 years 1 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
ICIP
2007
IEEE
14 years 11 months ago
Total Variation Image Restoration and Parameter Estimation using Variational Posterior Distribution Approximation
In this paper we propose novel algorithms for total variation (TV) based image restoration and parameter estimation utilizing variational distribution approximations. By following...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
HPCC
2007
Springer
14 years 4 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
NETWORKING
2010
13 years 11 months ago
Efficient Recovery from False State in Distributed Routing Algorithms
Abstract--Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. ...
Daniel Gyllstrom, Sudarshan Vasudevan, Jim Kurose,...
TCS
2008
13 years 9 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...