Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
Abstract In this paper we discuss the properties and algorithmic methods for the identification and classification of cyclical interdependencies in critical infrastructures based...
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...
by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative str...