Abstract. Subsystem based generalizations of rough set approximations are investigated. Instead of using an equivalence relation, an arbitrary binary relation is used to construct ...
class of general differentiable curves and surfaces and in turn refine this design to various parametric representations of curves and surfaces. This design includes all of the sta...
Philipp Slusallek, Reinhard Klein, Andreas Kolb, G...
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel's multiplicative L-nets. In J-proof nets, we can character...
We present a package which provides a visually oriented simulation of the execution of machine and assembly language programs on a simple computer. The programs am written for Hyp...
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...