We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
The performance of the fingerprint identification and verification systems relies heavily on the quality of the input fingerprint images. In this paper, we propose an effective im...
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...