244 search results - page 3 / 49 » On-Line Probability, Complexity and Randomness |
APAL
2008
13 years 5 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
QUESTA
2007
13 years 4 months ago
2007
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
STACS
2012
Springer
12 years 26 days ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
CORR
2011
Springer
13 years 9 days ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
TSP
2010
12 years 12 months ago
2010
In this paper, we propose the complex Gaussian scale mixture (CGSM) to model the complex wavelet coefficients as an extension of the Gaussian scale mixture (GSM), which is for real...