We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...