Sciweavers

255 search results - page 21 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
ICC
2007
IEEE
104views Communications» more  ICC 2007»
14 years 3 months ago
Multiplexing Video on Broadcast Channels via Convex Programs
— We propose a joint power- and rate-control scheme to broadcast a multiplicity of video sequences over a broadcast channel. The formulation is intended to be general in scope, w...
Raju Hormis, Elliot N. Linzer, Xiaodong Wang
DCC
2002
IEEE
14 years 8 months ago
Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang
NIPS
2007
13 years 10 months ago
Bundle Methods for Machine Learning
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
Alex J. Smola, S. V. N. Vishwanathan, Quoc V. Le
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 10 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 3 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...