We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
: We define a regularity axiom for lattice-valued convergence spaces where the lattice is a complete Heyting algebra. To this end, we generalize the characterization of regularity ...
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
We study finite bisimulations of dynamical systems in Rn defined by Pfaffian maps. The pure existence of finite bisimulations for a more general class of o-minimal systems was show...