452 search results - page 27 / 91 » A convex optimization approach to the mode acceleration prob... |
JMLR
2006
13 years 7 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
SIAMJO
2010
13 years 6 months ago
2010
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
TIP
2008
13 years 7 months ago
2008
The number of slices for error resilient video coding is jointly optimized with 802.11a-like media access control and the physical layers with automatic repeat request and rate com...
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
DSP
2006
13 years 7 months ago
2006
This paper considers the problem of sensor scheduling for the purposes of detection and tracking of "smart" targets. Smart targets are targets that can detect when they ...