This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
Abstract. We propose a new clustering algorithm satisfying requirements for the post-clustering algorithms as many as possible. The proposed “Fuzzy Concept ART” is the form of ...
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
Abstract. An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in o...