Sciweavers

525 search results - page 40 / 105
» Bidimensionality and geometric graphs
Sort
View
DCOSS
2010
Springer
14 years 4 days ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
ESA
2003
Springer
123views Algorithms» more  ESA 2003»
14 years 2 months ago
Experiments on Graph Clustering Algorithms
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
Ulrik Brandes, Marco Gaertler, Dorothea Wagner
ECEASST
2008
91views more  ECEASST 2008»
13 years 9 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner
ECCV
2008
Springer
14 years 10 months ago
Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs
This paper presents an approach for modeling landmark sites such as the Statue of Liberty based on large-scale contaminated image collections gathered from the Internet. Our system...
Xiaowei Li, Changchang Wu, Christopher Zach, Svetl...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 9 months ago
Tree-width of hypergraphs and surface duality
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
Frédéric Mazoit