Sciweavers

76 search results - page 5 / 16
» Compounding of gossip graphs
Sort
View
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
14 years 5 days ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray
NIPS
2004
13 years 8 months ago
An Application of Boosting to Graph Classification
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
Taku Kudo, Eisaku Maeda, Yuji Matsumoto
CGF
2008
110views more  CGF 2008»
13 years 7 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
JSAC
1998
126views more  JSAC 1998»
13 years 7 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey