Sciweavers

23589 search results - page 1 / 4718
» Uncheatable Distributed Computations
Sort
View
CTRSA
2001
Springer
109views Cryptology» more  CTRSA 2001»
13 years 9 months ago
Uncheatable Distributed Computations
Computationally expensive tasks that can be parallelized are most efficiently completed by distributing the computation among a large number of processors. The growth of the Intern...
Philippe Golle, Ilya Mironov
FC
2006
Springer
108views Cryptology» more  FC 2006»
13 years 8 months ago
Uncheatable Reputation for Distributed Computation Markets
Reputation systems aggregate mutual feedback of interacting peers into a "reputation" metric for each participant. This is then available to prospective service "req...
Bogdan Carbunar, Radu Sion
ACNS
2005
Springer
81views Cryptology» more  ACNS 2005»
13 years 10 months ago
Searching for High-Value Rare Events with Uncheatable Grid Computing
Abstract. High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (wh...
Wenliang Du, Michael T. Goodrich
PDPTA
2010
13 years 2 months ago
Distributed Mobile Computing: Development of Distributed Applications Using Mobile Agents
There exist distributed scenarios in which the need for dynamism, mobility, and adaptivity, has to be addressed with highly dynamical approaches. These scenarios present different ...
Carlos Bobed, Sergio Ilarri, Eduardo Mena
JMLR
2010
92views more  JMLR 2010»
12 years 11 months ago
Posterior distributions are computable from predictive distributions
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
Cameron E. Freer, Daniel M. Roy