48 search results - page 4 / 10 » Large k-Separated Matchings of Random Regular Graphs |
STACS
2004
Springer
14 years 26 days ago
2004
Springer
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 ...
JEI
2006
13 years 7 months ago
2006
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
CPHYSICS
2011
12 years 11 months ago
2011
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...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
COLING
2010
13 years 2 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...