Sciweavers

1493 search results - page 80 / 299
» Local resilience of graphs
Sort
View
GC
2004
Springer
14 years 1 months ago
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...
HYBRID
2010
Springer
14 years 28 days ago
Distributed Kalman Filter algorithms for self-localization of mobile devices
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
Anne-Kathrin Hess, Anders Rantzer
CISS
2007
IEEE
13 years 11 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
TCS
2008
13 years 7 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
3DIM
2007
IEEE
14 years 2 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee