26 search results - page 3 / 6 » Partition Functions of Normal Factor Graphs |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
CADE
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
CORR
2012
Springer
12 years 2 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
PAMI
2007
13 years 5 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
GECCO
2009
Springer
14 years 25 days ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...