391 search results - page 22 / 79 » Constructive Equivalence Relations on Computable Probability... |
116
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
APAL
2010
15 years 1 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
114
click to vote
ECCC
2011
14 years 8 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
118
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: Recent discoveries of a large variety of important roles for non-coding RNAs (ncRNAs) have been reported by numerous researchers. In order to analyze ncRNAs by kernel ...
108
click to vote
DSN
2008
IEEE
15 years 8 months ago
2008
IEEE
Embedded systems for closed-loop applications often behave as discrete-time semi-Markov processes (DTSMPs). Performability measures most meaningful to iterative embedded systems, ...