494 search results - page 8 / 99 » Optimal Carpet Cutting |
PAMI
2007
13 years 6 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
BMVC
2010
13 years 2 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
EOR
2002
13 years 7 months ago
2002
In multistage cutting stock problems (CSP) the cutting process is distributed over several successive stages. Every stage except the last one produces intermediate products. The l...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...