1605 search results - page 139 / 321 » On Partitional Labelings of Graphs |
106
click to vote
UAI
2003
15 years 2 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
102
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
116
click to vote
CRV
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
115
Voted
ECCV
1994
Springer
16 years 2 months ago
1994
Springer
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...
88
Voted
DCC
2008
IEEE
16 years 7 days ago
2008
IEEE
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...