2219 search results - page 186 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
125
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
130
click to vote
JMLR
2006
15 years 3 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...
148
click to vote
TON
2012
13 years 5 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
156
click to vote
IJRR
2008
15 years 3 months ago
2008
Bilateral symmetry is a salient visual feature of many man-made objects. In this paper, we present research that use bilateral symmetry to identify, segment and track objects in re...
107
click to vote
SAC
2004
ACM
15 years 8 months ago
2004
ACM
Field-based coordination is a very promising approach for a wide range of application scenarios in modern dynamic networks. To implement such an approach, one can rely on distribu...