Sciweavers

16430 search results - page 884 / 3286
» On Computable Tree Functions
Sort
View
COREGRID
2007
Springer
16 years 1 months ago
Co-Allocating Compute and Network Resources
Distributed applications or workflows need to access and use compute, storage and network resources simultaneously or chronologically coordinated respectively. Examples are distri...
Thomas Eickermann, Lidia Westphal, Oliver Wäl...
PODS
2005
ACM
86views Database» more  PODS 2005»
16 years 1 months ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv
SC
2005
ACM
16 years 1 months ago
A Power-Aware Run-Time System for High-Performance Computing
For decades, the high-performance computing (HPC) community has focused on performance, where performance is defined as speed. To achieve better performance per compute node, mic...
Chung-Hsing Hsu, Wu-chun Feng
ASIACRYPT
2005
Springer
16 years 1 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
SDMW
2004
Springer
16 years 29 days ago
Experimental Analysis of Privacy-Preserving Statistics Computation
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...
Hiranmayee Subramaniam, Rebecca N. Wright, Zhiqian...