736 search results - page 91 / 148 » Distinguishing geometric graphs |
114
click to vote
PR
2007
14 years 11 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
127
click to vote
EJC
2011
14 years 6 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
104
click to vote
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
This article addresses the problem of road extraction from new high resolution satellite images. The proposed algorithm is divided in two sequential modules : a topologically corr...
106
click to vote
ICCCN
2008
IEEE
15 years 6 months ago
2008
IEEE
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...