93
Voted
ITA
2006
15 years 11 days ago
2006
The problem of assessing the reliability of clusters patients identified by clustering algorithms is crucial to estimate the significance of subclasses of diseases detectable at b...
106
click to vote
ITA
2006
15 years 11 days ago
2006
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
ITA
2006
15 years 11 days ago
2006
93
Voted
ITA
2006
15 years 11 days ago
2006
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
89
Voted
ITA
2006
15 years 11 days ago
2006
We consider the four families of recognizable, synchronous, deterministic rational and rational subsets of a direct product of free monoids. They form a strict hierarchy and we in...
109
Voted
ITA
2006
15 years 11 days ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
ITA
2006
15 years 11 days ago
2006
100
Voted
ITA
2006
15 years 11 days ago
2006
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...