2434 search results - page 124 / 487 » Algorithmic Randomness of Closed Sets |
138
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
113
click to vote
CIE
2010
Springer
15 years 7 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
111
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Post translational modifications (PTMs) occur in the vast majority of proteins and are essential for function. Prediction of the sequence location of PTMs enhances the...
153
Voted
JCB
2006
15 years 3 months ago
2006
Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation con...
127
Voted
ALT
2008
Springer
16 years 16 days ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...