560 search results - page 20 / 112 » Level-set methods for convex optimization |
117
click to vote
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...
104
click to vote
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
117
click to vote
ACCV
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
123
click to vote
JMLR
2010
14 years 8 months ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
123
click to vote
JMLR
2006
15 years 1 months ago
2006
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...