1736 search results - page 15 / 348 » String Extension Learning |
126
click to vote
ALT
2006
Springer
16 years 19 days 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...
120
Voted
ECML
2004
Springer
15 years 9 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...
129
Voted
ACL
2009
15 years 1 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...
157
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...
264
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...