288 search results - page 9 / 58 » Notes on computing minimal approximant bases |
112
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
113
click to vote
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
107
Voted
PR
2007
15 years 1 months ago
2007
Tuning SVM hyperparameters is an important step in achieving a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the...
108
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....