1664 search results - page 73 / 333 » Distance labeling in graphs |
134
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
139
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
145
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
139
click to vote
AMR
2007
Springer
15 years 10 months ago
2007
Springer
This paper gives an overview of recent approaches towards image representation and image similarity computation for content-based image retrieval and automatic image annotation (ca...
113
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
A standard approach in pattern classification is to estimate the distributions of the label classes, and then to apply the Bayes classifier to the estimates of the distributions in...