1118 search results - page 48 / 224 » Convex Optimization |
140
click to vote
CVPR
2010
IEEE
15 years 4 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 ...
124
click to vote
NIPS
2008
15 years 5 months ago
2008
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
172
click to vote
SCIA
2009
Springer
15 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
185
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems ...
129
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...