328 search results - page 30 / 66 » Algorithms for the edge-width of an embedded graph |
102
click to vote
ICIP
2007
IEEE
15 years 3 months ago
2007
IEEE
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
IJON
2010
14 years 9 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
GD
2008
Springer
15 years 26 days ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
112
click to vote
ICMCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
GD
2005
Springer
15 years 5 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...