402 search results - page 70 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
AI
1999
Springer
13 years 6 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
ECCV
2006
Springer
14 years 8 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
ECCV
2006
Springer
14 years 8 months ago
2006
Springer
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
SCIA
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
MICCAI
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...