Abstract. Given two datasets DA and DB the closest-pair query (CPQ) retrieves the pair (a,b), where a ∈ DA and b ∈ DB, having the smallest distance between all pairs of objects...
Apostolos N. Papadopoulos, Alexandros Nanopoulos, ...
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Schemas evolve over time to accommodate the changes in the information they represent. Such evolution causes invalidation of various artifacts depending on the schemas, such as sc...
Abstract. In this paper, we present and analyze a framework for selfevolving autonomic services in a wireless nomadic environment. We present a disconnected network architecture, w...
Iacopo Carreras, Francesco De Pellegrini, Daniele ...
Aspect-Oriented Programming promises separation of concerns at the implementation level. However, aspects are not always orthogonal and aspect interaction is a fundamental problem...