1099 search results - page 16 / 220 » String Transformation Learning |
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
ECML
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we show a novel application of string kernels: that is to the problem of recognising famous pianists from their style of playing. The characterstics of perf...
ACL
2009
13 years 5 months ago
2009
This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string tr...