Sciweavers

6251 search results - page 291 / 1251
» Randomness, Computability, and Density
Sort
View
PODC
2006
ACM
16 years 18 days ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
ALT
2003
Springer
16 years 3 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
EUROCRYPT
2009
Springer
16 years 7 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 7 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICIP
2008
IEEE
16 years 8 months ago
Estimation of optimum coding redundancy and frequency domain analysis of attacks for YASS - a randomized block based hiding sche
Our recently introduced JPEG steganographic method called Yet Another Steganographic Scheme (YASS) can resist blind steganalysis by embedding data in the discrete cosine transform...
Anindya Sarkar, Lakshmanan Nataraj, B. S. Manjunat...