29908 search results - page 181 / 5982 » On the complexity of communication complexity |
135
click to vote
DLT
2008
15 years 8 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
170
click to vote
ENTCS
2006
15 years 6 months ago
2006
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
139
click to vote
IJBC
2008
15 years 6 months ago
2008
nodes and their interactions are abstract edges. This paper attempts to characterize the structural quality of complex software networks. We propose to use a novel statistical meas...
175
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
120
click to vote
ADVCS
2004
15 years 6 months ago
2004
We discuss the role of scale dependence of entropy/complexity and its relationship to component interdependence. The complexity as a function of scale of observation is expressed ...