A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
Michael Giudici, Cai Heng Li, Primoz Potocnik, Che...
– This paper analyses the results obtained when different topologies of 1-Dimensional Kohonen Networks where used to classify color pictures taken to Popocatépetl Volcano (locat...
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
While several hierarchical classification methods have been applied to web content, such techniques invariably rely on a pre-defined taxonomy of documents. We propose a new techni...
— This work details the authors’ efforts to push the baseline of expression recognition performance on a realistic database. Both subject-dependent and subject-independent emot...
Usman Tariq, Kai-Hsiang Lin, Zhen Li, Xi Zhou, Zha...