560 search results - page 35 / 112 » Level-set methods for convex optimization |
114
click to vote
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
144
click to vote
AAAI
2012
13 years 4 months ago
2012
Selecting the optimal kernel is an important and difficult challenge in applying kernel methods to pattern recognition. To address this challenge, multiple kernel learning (MKL) ...
126
click to vote
ASAP
2008
IEEE
15 years 4 months ago
2008
IEEE
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space exploration, while offering very favorable performance and...
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
A quadratic programming formulation for multiclass image segmentation is investigated. It is proved that, in the convex case, the non-negativity constraint on the recent reported ...
108
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...