70 search results - page 1 / 14 » QP Algorithms with Guaranteed Accuracy and Run Time for Supp... |
JMLR
2006
13 years 8 months ago
2006
We describe polynomial
NIPS
1998
13 years 10 months ago
1998
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) problem. This paper proposes an algorithm for training SVMs: Sequential Mi...
ICPR
2000
IEEE
14 years 28 days ago
2000
IEEE
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
KSEM
2009
Springer
14 years 3 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...
SADM
2010
13 years 7 months ago
2010
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...