486 search results - page 17 / 98 » Improved upper bounds for 3-SAT |
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
FOCS
1990
IEEE
14 years 15 days ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
ASIACRYPT
2001
Springer
14 years 3 days 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...