In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
The task of segmenting cell nuclei in microscope images is a classical image analysis problem. The accurate nuclei segmentation may contribute to development of successful system ...
Grigory Begelman, Eran Gur, Ehud Rivlin, Michael R...
The paper is devoted to fault diagnosis problems using fuzzy decision making. We investigate dynamic diagnostic systems which can be represented by symptom-fault rule bases. The m...
Oleksandr Sokolov, Michael Wagenknecht, Ulrike Goc...
Abstract. The basic aim of our study is to give a possible model for handling uncertain information. This model is worked out in the framework of DATALOG. At first the concept of f...