6719 search results - page 366 / 1344 » A Generalization of Automatic Sequences |
129
click to vote
MSCS
2006
15 years 4 months ago
2006
Abstract. In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalizati...
141
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Many applications in text and speech processing require the analysis of distributions of variable-length sequences. We recently introduced a general kernel framework, rational ker...
150
click to vote
FCT
2001
Springer
15 years 8 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
165
click to vote
NIPS
2000
15 years 5 months ago
2000
A goal of statistical language modeling is to learn the joint probability function of sequences of words in a language. This is intrinsically difficult because of the curse of dim...
151
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...