Network alignment generalizes and unifies several approaches for forming a matching or
alignment between the vertices of two graphs. We study a mathematical programming …

Data association, the problem of reasoning over correspondence between targets and
measurements, is a fundamental problem in tracking. This paper presents a graphical model …

In this paper, we investigate the use of message-passing algorithms for the problem of
finding the max-weight independent set (MWIS) in a graph. First, we study the performance …

It has recently been observed that the permanent of a nonnegative square matrix, ie, of a
square matrix containing only nonnegative real entries, can very well be approximated by …

We revisit the well-known problem of boolean group testing which attempts to discover a
sparse subset of faulty items in a large set of mostly good items using a small number of …

Interference coordination is a fundamental challenge in emerging femtocellular
deployments. This paper considers a broad class of interference coordination and resource …

2002fOO99519 A1 2003. O14. 0143 A1 2003.0185229 A1 2004/0267686 A1 2005/0048456
A1 2005/0226214 A1 2005/0243736 A1 2005/0265618 A1 2006/01 15267 A1 …

We consider the statistical inference problem of recovering an unknown perfect matching,
hidden in a weighted random graph, by exploiting the information arising from the use of two …

We establish that the min-sum message-passing algorithm and its asynchronous variants
converge for a large class of unconstrained convex optimization problems, generalizing …

Tracing microtubule centerlines in serial section electron tomography requires microtubules
to be stitched across sections, that is lines from different sections need to be aligned …