1028 search results - page 74 / 206 » Character sets of strings |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
JDA
2008
13 years 7 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U, conside...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
Recent theoretical and empirical work in statistical machine learning has demonstrated the importance of learning algorithms for deep architectures, i.e., function classes obtaine...
IVA
2005
Springer
14 years 1 months ago
2005
Springer
this is via the ”Motion Abstraction”. This is a single abstraction that represents any type of animation of a character. Different implementations of the ion can provide very ...