6045 search results - page 63 / 1209 » Computable Linearizations of Well-partial-orderings |
EMMCVPR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We follow recent work by Schoenemann et al. [25] for expressing curvature regularity as a linear program. While the original formulation focused on binary segmentation, w...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Online boosting methods have recently been used successfully for tracking, background subtraction etc. Conventional online boosting algorithms emphasize on interchanging new weak ...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...