In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Evolutionary computation has shown a great potential to work out several real-world problems in the point of optimization, but it is still quite far from realizing a system of matc...
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
— In this paper we demonstrate that our ability to match the EXtrinsic Information Transfer (EXIT) function of an Irregular Variable Length Code (IrVLC) to that of a seriallyconc...
Classifier fusion is considered as one of the best strategies for improving performances upon general purpose classification systems. On the other hand, fusion strategy space stro...
Wael Ben Soltana, Mohsen Ardabilian, Liming Chen, ...