— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
In this paper we study the problem of bounding the value of the probability distribution function of a random variable X at E[X] + a where a is a small quantity in comparison with...
We present a probabilistic framework for correspondence and egomotion. First, we suggest computing probability distributions of correspondence. This has the advantage of being rob...