Results 1  10
of
1,299
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 819 (28 self)
 Add to MetaCart
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical
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
that loopy propagation can also work well for graphs with many small loops. At the same time, our experimental results suggest a cautionary note about loopy propagation, showing that the marginals may exhibit oscillations that have very little correlation with the correct marginals. We presented some
Multiparty communication complexity of disjointness
 In Electronic Colloquium on Computational Complexity (ECCC
, 2008
"... on the kparty randomized communication n 1 k+1 2 2k (k−1)2 k−1 complexity of the Disjointness function in the ‘Number on the Forehead ’ model of multiparty communication. In particular, this yields a bound of nΩ(1) when k is a constant. The previous best lower bound for three players until recently ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
on the kparty randomized communication n 1 k+1 2 2k (k−1)2 k−1 complexity of the Disjointness function in the ‘Number on the Forehead ’ model of multiparty communication. In particular, this yields a bound of nΩ(1) when k is a constant. The previous best lower bound for three players until
Partition arguments in multiparty communication complexity
 CoRR
"... Consider the “Number in Hand ” multiparty communication complexity model, where k players holding inputs x1,..., xk ∈ {0, 1} n communicate to compute the value f(x1,..., xk) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Consider the “Number in Hand ” multiparty communication complexity model, where k players holding inputs x1,..., xk ∈ {0, 1} n communicate to compute the value f(x1,..., xk) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems
Upper Bounds on the Communication Complexity of Cryptographic Multiparty Computation
, 2004
"... Abstract. We give improved upper bounds on the communication complexity of optimallyresilient secure multiparty computation in the cryptographic model. We consider evaluating an nparty randomized function and show that if f can be computed by a circuit of size c, thenO(cn 2 κ + n 3 κ) is an upper ..."
Abstract
 Add to MetaCart
Abstract. We give improved upper bounds on the communication complexity of optimallyresilient secure multiparty computation in the cryptographic model. We consider evaluating an nparty randomized function and show that if f can be computed by a circuit of size c, thenO(cn 2 κ + n 3 κ) is an upper
On coding for reliable communication over packet networks
, 2008
"... We consider the use of random linear network coding in lossy packet networks. In particular, we consider the following simple strategy: nodes store the packets that they receive and, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of ..."
Abstract

Cited by 217 (37 self)
 Add to MetaCart
with coding delay. Our analysis of random linear network coding shows not only that it achieves packetlevel capacity, but also that the propagation of packets carrying “innovative ” information follows the propagation of jobs through a queueing network, thus implying that fluid flow models yield good
Lower bounds on quantum multiparty communication complexity
"... Abstract—A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power of two is known, despite significant efforts. We examine this question in the numberontheforehead model of mul ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract—A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power of two is known, despite significant efforts. We examine this question in the numberontheforehead model
An Application of the HalesJewett Theorem to Multiparty Communication Complexity
, 2004
"... Abstract We show, using the HalesJewett Theorem, that testing whether k subsets of [n] form a partition requires nonconstant communication complexity in the kparty "input on the forehead " model. This allows us in turn to answer an open problem of [7] by obtaining a lower bound ..."
Abstract
 Add to MetaCart
for the multiparty communication complexity of the regular language (c*ac*bc*)*. This note is mainly a short excerpt from my Ph. D. thesis. I have added enough context to make it selfcontained. 1 Multiparty Communication Complexity Chandra, Furst and Lipton introduced in [1] a model of multiparty
Separating Deterministic from Randomized Multiparty Communication Complexity
, 2008
"... We solve some fundamental problems in the numberonforehead (NOF) kplayer communication model. We show that there exists a function which has at most logarithmic communication complexity for randomized protocols with a onesided error probability of 1/3 but which has linear communication complex ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We solve some fundamental problems in the numberonforehead (NOF) kplayer communication model. We show that there exists a function which has at most logarithmic communication complexity for randomized protocols with a onesided error probability of 1/3 but which has linear communication
Robust multiparty computation with linear communication complexity
 In Advances in Cryptology – CRYPTO
, 2006
"... Abstract. We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively securely evaluate any polysized circuit with resilience t < n/2. The total communication complexity in bits ove ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Abstract. We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively securely evaluate any polysized circuit with resilience t < n/2. The total communication complexity in bits
Results 1  10
of
1,299