827 search results - page 120 / 166 » The Complexity of Probabilistic Lobbying |
155
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
177
click to vote
IJCAI
1997
15 years 7 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
135
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
189
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: A key challenge in metabonomics is to uncover quantitative associations between multidimensional spectroscopic data and biochemical measures used for disease risk asse...
171
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...