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...
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
Abstract. We study privacy guarantees for the owner of an information system who wants to share some of the information in the system with clients while keeping some other informat...
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Abstract. Natural systems, such as organs and organisms, are largescale complex systems with numerous elements and interactions. Modeling such systems can lead to better understand...