5390 search results - page 384 / 1078 » Support cluster machine |
175
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
171
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We propose a general framework for support vector machines (SVM) based on the principle of multi-objective optimization. The learning of SVMs is formulated as a multiobjective pro...
185
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
180
click to vote
MLDM
2009
Springer
16 years 1 months ago
2009
Springer
This paper describes recognition of emotions of an unkown person during natural walking. As gait data is redundant, high dimensional and variable, effective feature extraction is ...
186
click to vote
CPM
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...