1011 search results - page 167 / 203 » The three dimensions of proofs |
164
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS), providing new de...
164
click to vote
FC
2005
Springer
15 years 11 months ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
186
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
143
click to vote
WCC
2005
Springer
15 years 11 months ago
2005
Springer
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
140
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...