402 search results - page 60 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
TMI
2008
13 years 7 months ago
2008
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
DISOPT
2007
13 years 7 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
COCOA
2009
Springer
13 years 12 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
Traditional stereo algorithms estimate disparity at the same resolution as the observations. In this work we address the problem of estimating disparity and occlusion information ...
ECCV
2008
Springer
14 years 5 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...