5344 search results - page 135 / 1069 » Privacy-Preserving Set Operations |
113
click to vote
BPM
2008
Springer
15 years 4 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
119
Voted
DAGSTUHL
1996
15 years 4 months ago
1996
This paper concerns the use of program slicing to perform a certain kind of program-specialization operation. We show that the specialization operation that slicing performs is dif...
104
Voted
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
128
Voted
CATA
2003
15 years 4 months ago
2003
Many current general purpose processors use extensions to the instruction set architecture to enhance the performance of digital image processing and multimedia applications. In t...
107
Voted
ENTCS
2008
15 years 2 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...