Sciweavers

1434 search results - page 20 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
IPPS
2008
IEEE
15 years 5 months ago
Probabilistic allocation of tasks on desktop grids
While desktop grids are attractive platforms for executing parallel applications, their volatile nature has often limited their use to so-called “high-throughput” applications...
Joshua Wingstrom, Henri Casanova
75
Voted
TIT
2008
103views more  TIT 2008»
14 years 11 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
ASIACRYPT
2005
Springer
15 years 4 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
NDSS
2009
IEEE
15 years 5 months ago
Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
Sherman S. M. Chow, Jie-Han Lee, Lakshminarayanan ...
CSR
2007
Springer
15 years 3 months ago
On Empirical Meaning of Randomness with Respect to a Real Parameter
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
Vladimir V. V'yugin