Sciweavers

1736 search results - page 15 / 348
» String Extension Learning
Sort
View
ALT
2006
Springer
15 years 7 months ago
The Complexity of Learning SUBSEQ (A)
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...
Stephen A. Fenner, William I. Gasarch
ECML
2004
Springer
15 years 3 months ago
Using String Kernels to Identify Famous Performers from Their Playing Style
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...
Craig Saunders, David R. Hardoon, John Shawe-Taylo...
ACL
2009
14 years 8 months ago
Forest-based Tree Sequence to String Translation Model
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...
Hui Zhang, Min Zhang, Haizhou Li, AiTi Aw, Chew Li...
IPPS
2010
IEEE
14 years 8 months ago
Scalable multi-pipeline architecture for high performance multi-pattern string matching
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...
Weirong Jiang, Yi-Hua Edward Yang, Viktor K. Prasa...
189
Voted
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
15 years 11 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu