The max-sum labeling problem, defined as maximizing a sum of binary (ie, pairwise)
functions of discrete variables, is a general NP-hard optimization problem with many …

Network design problems (NDP) consist of identifying an optimal subgraph of a graph,
subject to side constraints. In generalized NDP, the vertex set is partitioned into clusters and …

Tree-reweighted max-product message passing (TRW) is an algorithm for energy
minimization introduced recently by Wainwright et al.[7]. It shares some similarities with …

State-of-the-art research on MRFs, successful MRF applications, and advanced topics for
future study. This volume demonstrates the power of the Markov random field (MRF) in …

In this paper, we present a new framework for geo-locating an image utilizing a novel
multiple nearest neighbor feature matching method using Generalized Minimum Clique …

Wireless communication is used in many different situations such as mobile telephony, radio
and TV broadcasting, satellite communication, wireless LANs, and military operations. In …

The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem
defined by a network of local cost functions defined over discrete variables. It has …

The problem considered in this paper consists in assigning frequencies to radio links
between base stations and mobile transmitters in order to minimize the global interference …

We study the computational complexity of exact minimization of rational-valued discrete
functions. Let Γ be a set of rational-valued functions on a fixed finite domain; such a set is …

A Bell inequality defined for a specific experimental configuration can always be extended to
a situation involving more observers, measurement settings, or measurement outcomes. In …