Label assignment problems with large state spaces are important tasks especially in computer vision. Often the pairwise interaction (or smoothness prior) between labels assigned at adjacent nodes (or pixels) can be described as a function of the label difference. Exact inference in such labeling tasks is still difficult, and therefore approximate inference methods based on a linear programming ...

A tournament is a binary dominance relation on a set of alternatives. Tournaments arise in many contexts that are relevant to AI, most notably in voting (as a method to aggregate the preferences of agents). There are many works that deal with choice rules that select a desirable alternative from a tournament, but very few of them deal directly with incentive issues, despite the fact that gameth...

We prove that for any separable Banach space X, there exists a compact metric space which is homeomorphic to the Cantor space and whose Lipschitz-free space contains a complemented subspace isomorphic to X. As a consequence we give an example of a compact metric space which is homeomorphic to the Cantor space and whose Lipschitz-free space fails the approximation property and we prove that ther...

A separated cell A of a topological space X is a family of pairwise disjoint open sets with the property that, for any partition A= A1 ∪ A2 of A, ⋃ A1 and ⋃ A2 are completely separated. The separated cellularity sc(X) of X is the supremum of all cardinals of separated cells. A space X has finite separation if it has no infinite separated cells. With X compact, every separated cell of X has size...

We prove that for any collection F of n ≥ 2 pairwise disjoint compact convex sets in the plane there is a pair A and B such line separates from either or subcollection with at least /18 sets.