568 search results - page 10 / 114 » New bounds for the Cebysev functional |
MOR
2010
13 years 5 months ago
2010
In this paper we study the problem of bounding the value of the probability distribution function of a random variable X at E[X] + a where a is a small quantity in comparison with...
CPC
2004
13 years 7 months ago
2004
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
We establish, for the first time, an explicit and simple lower bound on the nonlinearity Nf of a Boolean function f of n variables satisfying the avalanche criterion of degree p, ...