Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
In this paper, we present a novel algorithm for partial
intrinsic symmetry detection in 3D geometry. Unlike previous
work, our algorithm is based on a conceptually simple
and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...