2626 search results - page 235 / 526 » The complexity of stochastic sequences |
138
click to vote
JANCL
2006
15 years 6 months ago
2006
We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are welldesi...
173
click to vote
PR
2002
15 years 6 months ago
2002
This paper presents an e cient automatic face recognition scheme useful for video indexing applications. In particular7 the following problem is addressed: given a set of known fa...
126
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
195
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
178
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: High-throughput sequencing technologies, such as the Illumina Genome Analyzer, are powerful new tools for investigating a wide range of biological and medical question...