36 search results - page 5 / 8 » Concatenation of Graphs |
AAIM
2008
Springer
14 years 11 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
69
Voted
SWAT
1998
Springer
15 years 1 months 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 ...
81
Voted
SI3D
2003
ACM
15 years 2 months ago
2003
ACM
Many virtual environments and games must be populated with synthetic characters to create the desired experience. These characters must move with sufficient realism, so as not to...
CVPR
2000
IEEE
15 years 1 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small...