2210 search results - page 417 / 442 » CLEF 2001 - Overview of Results |
172
click to vote
ALT
2001
Springer
16 years 2 months ago
2001
Springer
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
180
click to vote
ICCAD
2001
IEEE
16 years 2 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
172
click to vote
SOSP
2001
ACM
16 years 2 months ago
2001
ACM
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
146
click to vote
SOFSEM
2009
Springer
16 years 2 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
146
click to vote
PKC
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...