We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
Abstract-- We present a novel GPU-based algorithm for highquality rendering of bivariate spline surfaces. An essential difference to the known methods for rendering graph surfaces ...
Gerd Reis, Frank Zeilfelder, Martin Hering-Bertram...
A spatially adaptive image deblurring algorithm is presented for Poisson observations. It adapts to the unknown image smoothness by using local polynomial approximation (LPA) kern...
Alessandro Foi, Sakari Alenius, Mejdi Trimeche, Vl...