Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
We present methods for eliminating or reducing the distortion in a scanned image. Aspects of the present paper allow for the automatic pruning, de-skewing, and unwarping of an ima...
Rough set theory has been considered as a useful tool to deal with inexact, uncertain, or vague knowledge. However, in real-world, most of information systems are based on dominanc...
The current research in granular computing is dominated by set-theoretic models such as rough sets and fuzzy sets. By recasting the existing studies in a wider context, we propose ...
This paper argues that a significant part of today’s Semantic Web research is still dominated by ideas from centralized databases. Furthermore, the main thread of reasoning rese...
Valentin Zacharias, Andreas Abecker, Denny Vrandec...