We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We pre...
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
In this paper we discuss 3D rendering as a solution to the line crossing problem associated with using connecting lines for illustrating relations in visual programming. The Bezie...
— The assessment of highly-risky situations at road intersections have been recently revealed as an important research topic within the context of the automotive industry. In thi...