419 search results - page 17 / 84 » Constraint models for graceful graphs |
UAI
2004
15 years 1 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
116
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
107
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
116
click to vote
CONSTRAINTS
2007
15 years 7 days ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
87
Voted
SMA
2005
ACM
15 years 5 months ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...