2398 search results - page 239 / 480 » Constraint Programming and Graph Algorithms |
180
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low tre...
182
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
185
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
168
click to vote
TACAS
2007
Springer
16 years 18 days ago
2007
Springer
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
172
click to vote
JMLR
2006
15 years 6 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...