For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
Multidimensional Morphable Model is a powerful model to analyze and synthesize human faces. However, the stochastic gradient descent algorithm adopted to match the Morphable Model...
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
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 ...