Sciweavers

2771 search results - page 247 / 555
» Locality of Queries and Transformations
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Sharing Random Bits with No Process Coordination
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...
Marius Zimand
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
15 years 7 months ago
Understanding elementary landscapes
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...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
CJ
2010
85views more  CJ 2010»
15 years 6 months ago
Multiparty Contracts: Agreeing and Implementing Interorganizational Processes
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...
KES
2008
Springer
15 years 6 months ago
A Secure Mediator for Integrating Multiple Level Access Control Policies
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...
Isabel F. Cruz, Rigel Gjomemo, Mirko Orsini
COMPUTING
2004
143views more  COMPUTING 2004»
15 years 6 months ago
Biorthogonal Loop-Subdivision Wavelets
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...
Martin Bertram