Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
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 ...