In this paper, we describe how a large webmail service uses reputation to classify authenticated sending domains as either spammy or not spammy. Both SPF and DomainKey authenticat...
—In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the protein’s amino acids and whose edges are the interactions between...
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...