The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
This paper is concerned with a universal pattern, which is defined as a character pattern designed to have high machine-readability. This universal pattern is a character pattern...
We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different feature spaces—so-called parallel universes—and also incorporates noise det...
The authors of this paper were tasked to create an automated campus-wide timetabling system, for both course and examination timetable scheduling, for the National University of S...
Andrew Lim, Ang Juay Chin, Wee-Kit Ho, Wee-Chong O...
Exponential stability of switched linear systems under both arbitrary and proper switching is studied through two suitably defined families of functions called the strong and the...