Results 1  10
of
760
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
marginals at the last two iterations. We only plot the diseases which had nonnegligible posterior probability. Loopy Belief Propagation . s=o� . a' range of prior To test this hypothesis, we reparameterized the pyra mid network as follows: we set the prior probability of the "1"
Compact Proofs of Retrievability
, 2008
"... In a proofofretrievability system, a data storage center must prove to a verifier that he is actually storing all of a client’s data. The central challenge is to build systems that are both efficient and provably secure — that is, it should be possible to extract the client’s data from any prover ..."
Abstract

Cited by 197 (0 self)
 Add to MetaCart
that passes a verification check. All previous provably secure solutions require that a prover send O(l) authenticator values (i.e., MACs or signatures) to verify a file, for a total of O(l 2) bits of communication, where l is the security parameter. The extra cost over the ideal O(l) communication can
Neural network exploration using optimal experiment design
 Neural Networks
, 1994
"... We consider the question "How should one act when the only goal is to learn as much as possible?" Building on the theoretical results of Fedorov [1972] and MacKay [1992], we apply techniques from Optimal Experiment Design (OED) to guide the query/action selection of a neural network lear ..."
Abstract

Cited by 161 (2 self)
 Add to MetaCart
We consider the question "How should one act when the only goal is to learn as much as possible?" Building on the theoretical results of Fedorov [1972] and MacKay [1992], we apply techniques from Optimal Experiment Design (OED) to guide the query/action selection of a neural network
Multiple access channels with arbitrarily correlated sources
 IEEE Transactions on Information Theory
, 1980
"... AbsrmcrLet {(q, r$)}#L * be a source of independealt identicauy distributed (i.i.d.) disc&e random variables with joint probability mass function p(u,o) and common part wf(u)=g(u) in the sense of Witsenbawn, Gacs, and Kkner. It is shown that such a source can be sent with arbitrarily small pro ..."
Abstract

Cited by 157 (1 self)
 Add to MetaCart
AbsrmcrLet {(q, r$)}#L * be a source of independealt identicauy distributed (i.i.d.) disc&e random variables with joint probability mass function p(u,o) and common part wf(u)=g(u) in the sense of Witsenbawn, Gacs, and Kkner. It is shown that such a source can be sent with arbitrarily small
MAC Polar Codes and Matroids
"... In this paper, a polar code for the muser multiple access channel (MAC) with binary inputs is constructed. In particular, Arıkan’s polarization technique applied individually to each user polarizes any muser binary input MAC into a finite collection of extremal MACs. The extremal MACs have a numb ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
; in this sense they are easy to communicate over. A polar code can then be constructed with an encoding and decoding complexity of O(n log n) (where n is the block length), a block error probability of o(exp(−n 1/2−ε)), and capable of achieving the uniform sum rate of any binary input MAC with arbitrary many
An Empirical Comparison of Four Initialization Methods for the KMeans Algorithm
, 1999
"... In this paper, we aim to compare empirically four initialization methods for the KMeans algorithm: random, Forgy, MacQueen and Kaufman. Although this algorithm is known for its robustness, it is widely reported in literature that its performance depends upon two key points: initial clustering an ..."
Abstract

Cited by 137 (0 self)
 Add to MetaCart
In this paper, we aim to compare empirically four initialization methods for the KMeans algorithm: random, Forgy, MacQueen and Kaufman. Although this algorithm is known for its robustness, it is widely reported in literature that its performance depends upon two key points: initial clustering
Lightweight MAC Algorithms
, 2003
"... Arcconsistency algorithms are the workhorse of backtrackers that Maintain ArcConsistency (MAC). This report will provide experimental evidence that, despite common belief to the contrary, it is not always necessary for a good arcconsistency algorithm to have an optimal worst case timecomplexity. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
spacecomplexity of O(e + nd), where n is the number of variables, d the maximum domain size, and e the number of constraints. We shall demonstrate that MAC2001's spacecomplexity is O(ed min(n; d)). MAC2001 required about 35% more solution time on average than MAC3 d for easy and hard random
About Mathematical MacTutor
"... Abstract: The Mathematical MacTutor is a powerful didactical sofware designed by Edmund Robertson and John O onnor at the University of St Andrews. The program provides an easy connection between mathematical experience, mathematical theory, and the history of mathematics. The user can explore the d ..."
Abstract
 Add to MetaCart
Abstract: The Mathematical MacTutor is a powerful didactical sofware designed by Edmund Robertson and John O onnor at the University of St Andrews. The program provides an easy connection between mathematical experience, mathematical theory, and the history of mathematics. The user can explore
The Security of MacGuffin
"... . This paper examines MacGuffin, a recently proposed block cipher based on a new DESlike architecture. The strength of MacGuffin against differential cryptanalysis is investigated: DES is more resistant to these attacks. A differential attack requiring 2 51:5 chosen plaintexts is described. In ad ..."
Abstract
 Add to MetaCart
. This paper examines MacGuffin, a recently proposed block cipher based on a new DESlike architecture. The strength of MacGuffin against differential cryptanalysis is investigated: DES is more resistant to these attacks. A differential attack requiring 2 51:5 chosen plaintexts is described
mac Keywords: e No
"... ont her owt es The s urban ulation the firs n rura n, 200 North American megacities include Mexico City, perhaps the second largest metropolitan area in the world, and Los Angeles and New York City in the United States, two of the ten largest Los Angeles and has been the subject of extensive air pol ..."
Abstract
 Add to MetaCart
1970 and the present, SoCAB VOC and NOx emissions have declined markedly despite a substantial increase in commerce and vehicle traffic (Cox et al., 2009). Peak O3
Results 1  10
of
760