402 search results - page 47 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
MM
2006
ACM
14 years 2 months ago
2006
ACM
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
ASPDAC
2005
ACM
14 years 2 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...