GC-sets are subsets T of Rd of cardinality dim Πn for which, for each τ ∈ T, there are n hyperplanes whose union contains all of T except for τ, thus making interpolation to a...
Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...
Hua-Ming Xing, Johannes H. Hattingh, Andrew R. Plu...
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
A fuzzy rule-based decision support system (DSS) is presented for the diagnosis of coronary artery disease (CAD). The system is automatically generated from an initial annotated da...
Markos G. Tsipouras, Themis P. Exarchos, Dimitrios...
— This paper proposes two hierarchical schemes for learning, one for clustering and the other for classification problems. Both schemes can be implemented on a fuzzy lattice neu...