9 search results - page 1 / 2 » Combinatorial approach to the interpolation method and scali... |
STOC
2010
ACM
13 years 8 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...
IPCO
2008
13 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
TSP
2008
13 years 4 months ago
2008
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...