480 search results - page 3 / 96 » Algorithmic tests and randomness with respect to a class of ... |
ICCD
2003
IEEE
14 years 1 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
CSR
2006
Springer
13 years 8 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
SIGIR
2002
ACM
13 years 4 months ago
2002
ACM
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
CCA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...