Results 11 to 20 of about 212 (69)
Around the root of random multidimensional quadtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle +2 more
doaj +1 more source
Optimal Prefix and Suffix Queries on Texts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Mäkinen and Navarro [Position-Restricted Substring Searching, LATIN 2006].
Maxime Crochemore +2 more
doaj +1 more source
Some exactly solvable models of urn process theory [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We establish a fundamental isomorphism between discrete-time balanced urn processes and certain ordinary differential systems, which are nonlinear, autonomous, and of a simple monomial form.
Philippe Flajolet +2 more
doaj +1 more source
Multivariate generalizations of the Foata-Schützenberger equidistribution [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A result of Foata and Schützenberger states that two statistics on permutations, the number of inversions and the inverse major index, have the same distribution on a descent class.
Florent Hivert +2 more
doaj +1 more source
Constrained exchangeable partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Alexander Gnedin
doaj +1 more source
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj +1 more source
The first ascent of size $d$ or more in compositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A composition of a positive integer $n$ is a finite sequence of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+ \cdots +a_k=n$. Let $d$ be a fixed nonnegative integer.
Charlotte Brennan, Arnold Knopfmacher
doaj +1 more source
Extended Rate, more GFUN [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a software package that guesses formulas for sequences of, for example, rational numbers or rational functions, given the first few terms.
Martin Rubey
doaj +1 more source
Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Consider a countable alphabet $\mathcal{A}$. A multi-modular hidden pattern is an $r$-tuple $(w_1,\ldots , w_r)$, where each $w_i$ is a word over $\mathcal{A}$ called a module.
Loïck Lhote, Manuel E. Lladser
doaj +1 more source
Efficient estimation of the cardinality of large data sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Giroire has recently proposed an algorithm which returns the $\textit{approximate}$ number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases.
Philippe Chassaing, Lucas Gerin
doaj +1 more source