It is easy to deduce from Ramsey's Theorem that, given positive integers a1, a2, . . . , am and a finite colouring of the set N of positive integers, there exists an injectiv...
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
One of the most widely used approaches in the context of object recognition across illumination changes consists in comparing the images by means of the intersection between invar...
—This paper describes a model of a hierarchical, heterogeneous knowledge-base. The proposed model consists of an associative level that is implemented by a Kanerva-like sparse di...
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...