We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...