736 search results - page 46 / 148 » Distinguishing geometric graphs |
108
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
DCOSS
2010
Springer
15 years 3 months ago
2010
Springer
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...
102
click to vote
ESA
2003
Springer
15 years 5 months ago
2003
Springer
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 ...
ECEASST
2008
14 years 12 months ago
2008
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...
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
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...