402 search results - page 68 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighte...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...
EMMCVPR
1999
Springer
13 years 11 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
ISMVL
2006
IEEE
14 years 1 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Previous efforts on event detection from the web have focused primarily on web content and structure data ignoring the rich collection of web log data. In this paper, we propose t...