14165 search results - page 424 / 2833 » The generalized two-server problem |
166
click to vote
NIPS
2007
15 years 8 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
149
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
231
click to vote
NECO
2011
15 years 1 months ago
2011
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...
207
click to vote
CP
2007
Springer
16 years 1 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
148
Voted
JMLR
2006
15 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 ...