3244 search results - page 243 / 649 » On convex complexity measures |
152
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an...
129
click to vote
ECCC
2010
15 years 6 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
156
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: A great deal of effort and expense are being expended internationally in attempts to detect genetic polymorphisms contributing to susceptibility to complex human disea...
161
click to vote
COCO
2004
Springer
16 years 1 hour ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
197
click to vote
ANSS
1996
IEEE
15 years 10 months ago
1996
IEEE
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...