6 search results - page 1 / 2 » Shortest Path Approaches for the Longest Common Subsequence ... |
BIBE
2007
IEEE
13 years 11 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
SIAMDM
1998
13 years 4 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
We present a robust method to map detected facial Action Units (AUs) to six basic emotions. Automatic AU recognition is prone to errors due to illumination, tracking failures and ...