486 search results - page 36 / 98 » Improved upper bounds for 3-SAT |
78
Voted
AAAI
1997
14 years 11 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
TVLSI
1998
14 years 9 months ago
1998
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
73
Voted
TIT
2011
14 years 4 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
79
Voted
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...