12 search results - page 2 / 3 » An efficient approach to updating simplex multipliers in the... |
SODA
1998
ACM
13 years 7 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
JMLR
2008
13 years 6 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
JMLR
2006
13 years 6 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 ...
AAAI
2010
13 years 7 months ago
2010
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
ICDE
2002
IEEE
14 years 7 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...