In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
In its basic form, a variability model describes the variations among similar artifacts from a structural point of view. It does not capture any information about when these variat...
Christoph Elsner, Goetz Botterweck, Daniel Lohmann...
This paper shows how to build a scalable, robust and efficient distributed Internet-scale RDF repository, that we name PAGE (Put And Get Everywhere). 1 Motivation In the recent yea...
Emanuele Della Valle, Andrea Turati, Alessandro Gh...
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
In this paper, we dLscuss the approach we take to the interpretation of instructions. Instructions describe actions related to each other and to other goals the agent may have; ou...