35 search results - page 3 / 7 » Counting dependent and independent strings |
CPC
2008
14 years 10 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
COLT
1992
Springer
15 years 2 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
111
click to vote
APBC
2008
14 years 11 months ago
2008
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
NAA
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Various variants of Schwarz methods for a singularly perturbed two dimensional stationary convection-diffusion problem are constructed and analysed. The iteration counts,...
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...