422 search results - page 28 / 85 » Shortest paths between shortest paths and independent sets |
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
SWAT
1998
Springer
14 years 27 days ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
EMMCVPR
2007
Springer
14 years 2 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
In order to analyze shapes of continuous curves in R3 , we parameterize them by arc-length and represent them as curves on a unit two-sphere. We identify the subset denoting the cl...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...