component of the reflection has been considered (2, This paper propose a hierarchical design method of camera and light-source positioning for model based vision. In this method, f...
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
We consider the problem of minimizing the size of a set system G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and...