1370 search results - page 165 / 274 » On grids in topological graphs |
192
click to vote
DC
2002
15 years 6 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
188
click to vote
ALGOSENSORS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
175
click to vote
CGF
2010
15 years 6 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
171
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Ideally, every pixel within each superpixel region will be...
172
click to vote
ICDCSW
2009
IEEE
16 years 1 months ago
2009
IEEE
Broadcast of information in wireless sensor networks is an important operation, e.g., for code updates, queries, membership information, etc. In this paper, we analyze and experim...