Related papers: The Sum-Product Algorithm for Degree-2 Check Nodes…
We introduce the notion of a bicocycle double cross product (resp. sum) Lie group (resp. Lie algebra), and a bicocycle double cross product bialgebra, generalizing the unified products. On the level of Lie groups the construction yields a…
A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content. Many algorithms have been proposed to extract such summaries automatically. How best to evaluate these outputs is…
In this paper, we establish some theoretical connections between Sum-Product Networks (SPNs) and Bayesian Networks (BNs). We prove that every SPN can be converted into a BN in linear time and space in terms of the network size. The key…
Staircase codes (SCCs) are typically decoded using iterative bounded-distance decoding (BDD) and hard decisions. In this paper, a novel decoding algorithm is proposed, which partially uses soft information from the channel. The proposed…
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical…
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…
We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subspace metric, and linearized Reed-Solomon codes in the…
In this paper, we present a low-complexity joint detection-decoding algorithm for nonbinary LDPC codedmodulation systems. The algorithm combines hard-decision decoding using the message-passing strategy with the signal detector in an…
Graph embedding is a transformation of nodes of a graph into a set of vectors. A~good embedding should capture the graph topology, node-to-node relationship, and other relevant information about the graph, its subgraphs, and nodes. If these…
Let S and T be vectors of positive integers with the same sum. We study the uniform distribution on the space of simple bipartite graphs with degree sequence S in one part and T in the other; equivalently, binary matrices with row sums S…
In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and ordered set union, intersection and difference.…
We give a parallel $O(\log(n))$-time algorithm on a CRCW PRAM to assign vertical and horizontal segments to the vertices of any planar bipartite graph $G$ in the following manner: i) Two segments cannot share an interior point ii) Two…
Sum-product networks (SPNs) represent an emerging class of neural networks with clear probabilistic semantics and superior inference speed over graphical models. This work reveals a strikingly intimate connection between SPNs and tensor…
In this paper, we present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion principle nor tree-decompositions. For any bipartite graph of $2n$ nodes and $\Delta n$ edges such that $\Delta \geq…
In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
A method for encoding and decoding spectrum shaped binary run-length constrained sequences is described. The binary sequences with predefined range of exponential sums are introduced. On the base of Cover's enumerative scheme, recurrence…
For a simple algebraic group $G$ over an algebraically closed field, we study products of normal subsets. For this we mark the nodes of the Dynkin diagram of $G$. We use two types of labels, a binary marking and a labeling with non-negative…
Modern approaches for fast retrieval of similar vectors on billion-scaled datasets rely on compressed-domain approaches such as binary sketches or product quantization. These methods minimize a certain loss, typically the mean squared error…