422 search results - page 52 / 85 » On Non-Approximability for Quadratic Programs |
JMLR
2006
13 years 8 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 ...
POPL
2001
ACM
14 years 8 months ago
2001
ACM
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
CVPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
IDA
2007
Springer
14 years 2 months ago
2007
Springer
We present a new machine learning approach to the inverse parametric sequence alignment problem: given as training examples a set of correct pairwise global alignments, find the p...