Sciweavers

76 search results - page 4 / 16
» Compounding of gossip graphs
Sort
View
GD
2004
Springer
14 years 25 days ago
Visualizing Large Graphs with Compound-Fisheye Views and Treemaps
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalizat...
James Abello, Stephen G. Kobourov, Roman Yusufov
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
MIDDLEWARE
2007
Springer
14 years 1 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta
HPCC
2005
Springer
14 years 1 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah