For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
We propose a closed form solution for segmenting mixtures of 2-D translational and 2-D affine motion models directly from the image intensities. Our approach exploits the fact that...
Given rapid improvements in network infrastructure and streaming-media technologies, a large number of corporations and universities are recording lectures and making them availab...
Qiong Liu, Yong Rui, Anoop Gupta, Jonathan J. Cadi...
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...