We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
Human identity recognition is an important yet underaddressed
problem. Previous methods were strictly limited
to high quality photographs, where the principal techniques
heavily...
In order to deploy mobile robots in social environments like indoor buildings, they need to be provided with perceptual abilities to detect people. In the computer vision literatur...
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...