[[abstract]]In this thesis we mainly aim to compute the expected waiting time of a certain pattern in Markov chain of order $m$ and the relative probabilities of every ending scenarios. Moreover, we can calculate the closed form of the expected waiting and generalize the results in Glaz, Kulldorff, Pozdnyakov, and Steele (2006)
This paper proposes a new characterization of queueing systems by bounding a suitable exponential tr...
Session 8B: Pattern Matching/String AlgorithmWe revisit the waiting time of patterns in repeated ind...
AbstractRandom variables are collected one at a time until the last k variables satisfy a given cond...
[[abstract]]In this thesis, we are mainly concerned with the expected waiting time of certain patter...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Sequence patterns, runs, sooner and later problems, r-th occurrence problem, discrete distribution o...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Analysis of AlgorithmsIn this paper we consider the distribution of a pattern of interest in a binar...
We discuss the dynamics of continuous time semi-markov chains with phase-type waiting times. It is s...
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding meth...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
Consideremos uma sequência de lançamentos de moedas em que denotamos o resultado de cada lançamento ...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
This paper proposes a new characterization of queueing systems by bounding a suitable exponential tr...
Session 8B: Pattern Matching/String AlgorithmWe revisit the waiting time of patterns in repeated ind...
AbstractRandom variables are collected one at a time until the last k variables satisfy a given cond...
[[abstract]]In this thesis, we are mainly concerned with the expected waiting time of certain patter...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
Sequence patterns, runs, sooner and later problems, r-th occurrence problem, discrete distribution o...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
Analysis of AlgorithmsIn this paper we consider the distribution of a pattern of interest in a binar...
We discuss the dynamics of continuous time semi-markov chains with phase-type waiting times. It is s...
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding meth...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
Consideremos uma sequência de lançamentos de moedas em que denotamos o resultado de cada lançamento ...
Abstract. A new martingale technique is developed to find formulas for the first two moments and gen...
This paper proposes a new characterization of queueing systems by bounding a suitable exponential tr...
Session 8B: Pattern Matching/String AlgorithmWe revisit the waiting time of patterns in repeated ind...
AbstractRandom variables are collected one at a time until the last k variables satisfy a given cond...