The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...
Thomas Schoenemann, Fredrik Kahl, Simon Masnou, Da...
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of s...