The suitability of the well known kernels for trees, and the lesser known SelfOrganizing Map for Structures for categorization tasks on structured data is investigated in this pap...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
We present a method for automatically selecting optimal implementations of sparse matrixvector operations. Our software ‘AcCELS’ (Accelerated Compress-storage Elements for Lin...
Alfredo Buttari, Victor Eijkhout, Julien Langou, S...
Extending recognition to uncontrolled situations is a key challenge for practical face recognition systems. Finding efficient and discriminative facial appearance descriptors is c...
Abstract. In this paper, we consider the possibility of obtaining a kernel machine that is sparse in feature space and smooth in output space. Smooth in output space implies that t...
We describe a kernel method which uses the maximization of Onicescu’s informational energy as a criteria for computing the relevances of input features. This adaptive relevance d...