373 search results - page 19 / 75 » On Markov Chains for Independent Sets |
FCS
2009
13 years 5 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
ICGI
2004
Springer
14 years 28 days ago
2004
Springer
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...
IJBRA
2006
13 years 7 months ago
2006
: Probabilistic models for biological sequences (DNA and proteins) are frequently used in bioinformatics. We describe statistical tests designed to detect the order of dependency a...
BMCBI
2004
13 years 7 months ago
2004
Background: Certain protein families are highly conserved across distantly related organisms and belong to large and functionally diverse superfamilies. The patterns of conservati...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...