704 search results - page 3 / 141 » Isometrically Embedded Graphs |
INFOCOM
2009
IEEE
14 years 29 days 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...
SMI
2008
IEEE
14 years 20 days ago
2008
IEEE
This paper presents a method to extract skeletons using examples. Our method is based on the observation that many deformations in real world applications are isometric or near is...
DAM
2011
13 years 1 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
EJC
2006
13 years 6 months ago
2006
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
SCALESPACE
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The problem of isometry-invariant representation and comparison of surfaces is of cardinal importance in pattern recognition applications dealing with deformable objects....