Sciweavers

1855 search results - page 4 / 371
» A coding theorem for distributed computation
Sort
View
CN
2006
70views more  CN 2006»
13 years 7 months ago
Distribution of path durations in mobile ad-hoc networks - Palm's Theorem to the rescue
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
Yijie Han, Richard J. La, Armand M. Makowski, Seun...
TARK
2009
Springer
14 years 2 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
CCA
2009
Springer
14 years 2 months ago
Computability of Probability Distributions and Distribution Functions
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi
JMLR
2010
92views more  JMLR 2010»
13 years 2 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
ESOP
2006
Springer
13 years 11 months ago
A Typed Assembly Language for Confidentiality
Language-based information-flow analysis is promising in protecting data confidentiality. Although much work has been carried out in this area, relatively little has been done for ...
Dachuan Yu, Nayeem Islam