Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...