In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
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...
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...
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...
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 ...