537 search results - page 27 / 108 » A new upper bound for 3-SAT |
CRYPTO
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
ANOR
2008
13 years 8 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
TIT
2008
13 years 8 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...