76 search results - page 9 / 16 » Compounding of gossip graphs |
CDC
2009
IEEE
14 years 6 days ago
2009
IEEE
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
PODC
2009
ACM
14 years 4 days ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
ISI
2007
Springer
13 years 7 months ago
2007
Springer
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
IV
2009
IEEE
14 years 2 months ago
2009
IEEE
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...