31 search results - page 4 / 7 » Progressive cut |
115
click to vote
SIAMJO
2011
14 years 8 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
105
click to vote
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
107
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
224
click to vote
MICCAI
2010
Springer
15 years 7 months ago
2010
Springer
While there has been substantial progress in segmenting natural im-
ages, state-of-the-art methods that perform well in such tasks unfortunately tend
to underperform ...
COLING
2008
15 years 3 months ago
2008
Treating classification as seeking minimum cuts in the appropriate graph has proven effective in a number of applications. The power of this approach lies in its ability to incorp...