Sciweavers

1763 search results - page 276 / 353
» A Formalization of Polytime Functions
Sort
View
ASIAN
2005
Springer
115views Algorithms» more  ASIAN 2005»
15 years 3 months ago
Practical Ontology Systems for Enterprise Application
One of the main challenges in building enterprise applications has been to balance between built-in functionality and domain/scenario-specific customization. The lack of formal way...
Dongkyu Kim, Sang-goo Lee, Junho Shim, Jonghoon Ch...
ESWS
2005
Springer
15 years 3 months ago
Optimally Distributing Interactions Between Composed Semantic Web Services
When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed...
Ion Constantinescu, Walter Binder, Boi Faltings
FORMATS
2005
Springer
15 years 3 months ago
Quantifying Similarities Between Timed Systems
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
Thomas A. Henzinger, Rupak Majumdar, Vinayak S. Pr...
ICALP
2005
Springer
15 years 3 months ago
Basing Cryptographic Protocols on Tamper-Evident Seals
Abstract. In this paper we attempt to formally study two very intuitive physical models: sealed envelopes and locked boxes, often used as illustrations for common cryptographic ope...
Tal Moran, Moni Naor
ICCBSS
2005
Springer
15 years 3 months ago
Specifying Interaction Constraints of Software Components for Better Understandability and Interoperability
A vital issue in the correct use of commercial-off-the-shelf (COTS) components is the proper understanding of their functionality, quality attributes and ways of operation. Traditi...
Yan Jin, Jun Han