Sciweavers

1923 search results - page 243 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ISI
2008
Springer
15 years 2 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh
PODC
2010
ACM
15 years 6 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
SRDS
2006
IEEE
15 years 8 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
SPAA
2009
ACM
16 years 2 months ago
Mapping filtering streaming applications with communication costs
In this paper, we explore the problem of mapping filtering streaming applications on large-scale homogeneous platforms, with a particular emphasis on communication models and thei...
Kunal Agrawal, Anne Benoit, Fanny Dufossé, ...
EGC
2005
Springer
15 years 7 months ago
HotGrid: Graduated Access to Grid-Based Science Gateways
Abstract. We describe the idea of a Science Gateway, an applicationspecific task wrapped as a web service, and some examples of these that are being implemented on the US TeraGrid...
Roy Williams, Conrad Steenberg, Julian J. Bunn