147 search results - page 13 / 30 » Algorithms for Computing the Longest Parameterized Common Su... |
116
Voted
IPL
2010
15 years 1 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
127
Voted
ICIP
2002
IEEE
16 years 4 months ago
2002
IEEE
We propose a fast text/graphics resolution improvement algorithm with boundary parameterization and wavelet based denoising. Given input images containing labeled text/graphics ob...
127
Voted
MMM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we propose a new algorithm to find video clips with different temporal durations and some spatial variations. We adopt a longest common subsequence (LCS) matching t...
114
click to vote
JCB
2000
15 years 2 months ago
2000
We study the problem of similarity detection by sequence alignment with gaps, using a recently established theoretical framework based on the morphology of alignment paths. Alignm...
109
Voted
ACL
2006
15 years 4 months ago
2006
This paper proposes a new approach for Multi-word Expression (MWE)extraction on the motivation of gene sequence alignment because textual sequence is similar to gene sequence in p...