667 search results - page 31 / 134 » Learning to Model Sequences Generated by Switching Distribut... |
113
click to vote
COLT
1994
Springer
15 years 6 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
106
click to vote
BMCBI
2007
15 years 1 months ago
2007
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
114
click to vote
SP
2006
IEEE
15 years 8 months ago
2006
IEEE
Linux is the most popular open source project. The Linux random number generator is part of the kernel of all Linux distributions and is based on generating randomness from entrop...
118
click to vote
COLT
1995
Springer
15 years 5 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
113
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...