Practically Perfect Pi Chains
نویسندگان
چکیده
منابع مشابه
Practically Perfect
We prove that perfect distributions exist when using a finite number of bits to represent the parameters of a Bayesian network. In addition, we provide an upper bound on the probability of sampling a non-perfect distribution when using a fixed number of bits for the parameters and that the upper bound approaches zero exponentially fast as one increases the number of bits. We also provide an upp...
متن کاملObservations on practically perfect CSCW
Technical systems are so powerful that there is a temptation to try to provide ‘perfect’ support for any cooperative work practice. Some CSCW problems result from designs motivated by optimising technical criteria. A very high bandwidth network, for instance, can support a wide variety of work patterns; the consequent focus of solving the salient technical problems gives the impression that CSC...
متن کامل"Practically perfect pitch": some comments.
If instead of elliptical cones, right circular cones are employed, then • • 8 and only the expression for B is changed. In particular for a fixed 8, this causes the 1R. A. Rasmussen and N. E. Head, "Characteristics of High Frequency Sea Reverberation and Their Application to Turbulence Measurement," J. Acoust. Sec. Am. 59, 55-61 (1976). 2E. J. Sullivan and K. A. Kemp, "The Significance'of Beam ...
متن کاملBroadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains constructed with the squaring function which gives the possibility to construct a one-way chain of whose length is unbounded in practice. Although the computational cost is somewhat increased, compared to the use of hash...
متن کاملPerfect Sampling Using Bounding Chains
Bounding chains are a technique that offers three benefits to Markov chain practitioners: a theoretical bound on the mixing time of the chain under restricted conditions, experimental bounds on the mixing time of the chain that are provably accurate and construction of perfect sampling algorithms when used in conjunction with protocols such as coupling from the past. Perfect sampling algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2011
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.331.6023.1367-b