537 search results - page 99 / 108 » A new upper bound for 3-SAT |
CCA
2009
Springer
14 years 1 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
EUROCRYPT
1999
Springer
14 years 21 days ago
1999
Springer
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
COMPGEOM
2007
ACM
14 years 11 days ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
APPROX
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
Databases in real life are often neither entirely closed-world nor entirely open-world. Indeed, databases in an enterprise are typically partially closed, in which a part of the d...