1173 search results - page 60 / 235 » On the Compositionality of Round Abstraction |
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We show that only languages in BPP have public-coin, blackbox zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. Thi...
PKDD
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
SOCO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
EPEW
2005
Springer
14 years 3 months ago
2005
Springer
We address the problem of composing Web Services in long-running transactional business processes, where compensations must be dealt with appropriately. The framework presented in ...
ICICS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Multimedia community is moving from monolithic applications to more flexible and scalable integrated solutions. Stream authentication is more complex since a stream may ...