Sciweavers

157 search results - page 25 / 32
» Presenting Proofs with Adapted Granularity
Sort
View
FOCS
1998
IEEE
13 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
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...
John C. Mitchell, Mark Mitchell, Andre Scedrov
ICLP
1999
Springer
13 years 11 months ago
Bounded Nondeterminism of Logic Programs
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...
Dino Pedreschi, Salvatore Ruggieri
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
OAEP Reconsidered
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...
Victor Shoup
EON
2008
13 years 9 months ago
Synthesizing the Mediator with jABC/ABC
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 (...
Tiziana Margaria
SIGMOD
2008
ACM
116views Database» more  SIGMOD 2008»
14 years 7 months ago
SPADE: the system s declarative stream processing engine
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 ...
Bugra Gedik, Henrique Andrade, Kun-Lung Wu, Philip...