The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
This paper presents an approximation method for numerically solving general Markov modulated fluid models which are widely used in modelling communications and computer systems. ...
We present a novel framework for automated extraction and approximation of numerical object attributes such as height and weight from the Web. Given an object-attribute pair, we d...