2095 search results - page 80 / 419 » Improved pebbling bounds |
GLVLSI
2005
IEEE
14 years 3 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
ICML
2004
IEEE
14 years 3 months ago
2004
IEEE
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...
COLT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
CRYPTO
2006
Springer
14 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...
CP
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...