Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, ea...
This paper proposes a method for stroke segmentation to decompose Chinese characters to become individual strokes. The method first obtains the medial axes of any given Chinese cha...
Persistence of conversations has been found to be a useful feature in group chat tools. When conversations are stored and made accessible to all members of a group, they can facil...
Abstract. For any set-endofunctor T : Set → Set there exists a largest subcartesian transformation µ to the filter functor F : Set → Set. Thus we can associate with every T-c...