We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
In some real world situations, linear models are not sufficient to represent accurately complex relations between input variables and output variables of a studied system. Multila...
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
We study the dynamics of the Naming Game [Baronchelli et al., (2006) J. Stat. Mech.: Theory Exp. P06014] in empirical social networks. This stylized agentbased model captures essen...
In this work, we describe a simple 1-mask sacrificial layer process that allows us to prototype a tuneable capacitor. The process is specially optimized to procure a dual picks pr...