161 search results - page 26 / 33 » Methods for convex and general quadratic programming |
171
Voted
KSEM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
165
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
120
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
138
click to vote
IJRR
2002
15 years 4 months ago
2002
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
143
click to vote
CVPR
1997
IEEE
15 years 8 months ago
1997
IEEE
We describe a new method for camera autocalibration and scaled Euclidean structure and motion, from three or more views taken by a moving camera with fixed but unknown intrinsic ...