We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
A contract specifies an interorganizational process together with a distribution of responsibilities for the activities among the parties involved. In this paper, we formally show ...
Wil M. P. van der Aalst, Niels Lohmann, Peter Mass...
Abstract. We present a method for mapping security levels among the components of a distributed system where data in the local sources are represented in XML. Distributed data is i...
We present a biorthogonal wavelet construction for Loop subdivision, based on the lifting scheme. Our wavelet transform uses scaling functions that are recursively defined by Loop...