157 search results - page 25 / 32 » Presenting Proofs with Adapted Granularity |
115
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
124
Voted
ICLP
1999
Springer
15 years 6 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
127
click to vote
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
122
Voted
EON
2008
15 years 3 months ago
2008
Abstract. In this paper we show how to apply a tableau-based software composition technique to automatically generate the mediator's service logic. This uses an LTL planning (...
199
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at ...