10988 search results - page 406 / 2198 » Algorithmic Folding Complexity |
158
Voted
ICPR
2000
IEEE
15 years 9 months ago
2000
IEEE
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
125
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
138
Voted
CORR
2004
Springer
15 years 5 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
166
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Learning to rank from relevance judgment is an active research area. Itemwise score regression, pairwise preference satisfaction, and listwise structured learning are the major te...
155
click to vote
SIGMOD
2002
ACM
16 years 5 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...