A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
We present a probabilistic approach to shape matching which is invariant to rotation, translation and scaling. Shapes are represented by unlabeled point sets, so discontinuous bou...