We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...
To utilize CT or MRI images for computer aided diagnosis applications, robust features that represent 3-D image data need to be constructed and subsequently used by a classificati...
We consider the problem of estimating the covariance matrix of an observation vector, using heterogeneous training samples, i.e., samples whose covariance matrices are not exactly ...