In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
The Universum data, defined as a collection of "nonexamples" that do not belong to any class of interest, have been shown to encode some prior knowledge by representing ...
Dan Zhang, Jingdong Wang, Fei Wang, Changshui Zhan...
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...