81 search results - page 1 / 17 » Bounding the Partition Function of Spin-Systems |
COMBINATORICS
2006
14 years 9 months ago
2006
With a graph G = (V, E) we associate a collection of non-negative real weights vV {i,v : 1 i m} uvE{ij,uv : 1 i j m}. We consider the probability distribution on {f : V {1,...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
— Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we ...
IPL
2002
14 years 9 months ago
2002
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
TSP
2010
14 years 4 months ago
2010
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
107
click to vote
AAAI
2010
14 years 11 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...