We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
Abstract— This paper investigates control laws allowing mobile, autonomous agents to optimally position themselves on the line for distributed sensing in a nonuniform field. We ...
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when th...
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...