Sciweavers

5326 search results - page 155 / 1066
» On what we can ensure
Sort
View
COORDINATION
2007
Springer
16 years 18 days ago
A Theory for Strong Service Compliance
We investigate, in a process algebraic setting, a new notion of compliance that we call strong service compliance: composed services are strong compliant if their composition is bo...
Mario Bravetti, Gianluigi Zavattaro
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
Yehuda Lindell
WWW
2007
ACM
16 years 7 months ago
Bringing Semantics to Web Services with OWL-S
Current industry standards for describing Web Services are focused on ensuring interoperability across diverse platforms, but do not provide a good foundation for automating the u...
David L. Martin, Mark H. Burstein, Drew V. McDermo...
WWW
2001
ACM
16 years 7 months ago
Communication design for electronic negotiations on the basis of XML schema
Representation of negotiations in electronic markets and their support are important issues in today's e-commerce research. Whereas most activities are focused on automation ...
Michael Ströbel
COMPUTER
2000
180views more  COMPUTER 2000»
15 years 6 months ago
The Challenges of Automatic Summarization
tion--the art of abstracting key content from one or more information sources--has become an integral part of everyday life. People keep abreast of world affairs by listening to ne...
Udo Hahn, Inderjeet Mani