427 search results - page 39 / 86 » Computing the Local Consensus of Trees |
145
click to vote
EVOW
2010
Springer
15 years 9 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
128
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
179
click to vote
PAMI
2006
15 years 5 months ago
2006
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
151
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Many rural roads lack sharp, smoothly curving edges and a homogeneous surface appearance, hampering traditional vision-based road-following methods. However, they often have stron...
159
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...