Sciweavers

48 search results - page 5 / 10
» Partial Lagrangian relaxation for general quadratic programm...
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Direct convex relaxations of sparse SVM
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
Antoni B. Chan, Nuno Vasconcelos, Gert R. G. Lanck...
EOR
2007
111views more  EOR 2007»
13 years 7 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proļ...
Byungjun You, Takeo Yamada
NIPS
2007
13 years 9 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random ļ¬eld (i.e. a random ļ¬eld deļ¬ned using a ļ¬nite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
CVPR
2012
IEEE
11 years 10 months ago
Generalized Multiview Analysis: A discriminative latent space
This paper presents a general multi-view feature extraction approach that we call Generalized Multiview Analysis or GMA. GMA has all the desirable properties required for cross-vi...
Abhishek Sharma, Abhishek Kumar, Hal Daumé ...
TSP
2010
13 years 2 months ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar