We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
Flexible discriminant analysis (FDA) is a general methodology which aims at providing tools for multigroup non linear classification. It consists in a nonparametric version of dis...
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
In this paper, we present a new color image segmentation scheme based on unsupervised pixel classification that works even when there is not a one-to-one correspondence between th...
Ludovic Macaire, Nicolas Vandenbroucke, Jack-G&eac...