229 search results - page 2 / 46 » Ergodic-Type Characterizations of Algorithmic Randomness |
TCS
1998
13 years 4 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
COMCOM
2010
13 years 5 months ago
2010
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
14
Voted
ITA
2006
13 years 4 months 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...
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
IANDC
2011
12 years 12 months ago
2011
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...