In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Cross-traffic data rate over the tight link of a path can be estimated using different active probing packet dispersion techniques. Many of these techniques send large amounts of p...
This paper introduces a simple and efficient representation for natural images. We partition an image into blocks and treat the blocks as vectors in a high-dimensional space. We t...
Many large scale physics-based simulations which take place on PC clusters or supercomputers produce huge amounts of data including vector fields. While these vector data such as ...
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
Maria Kontaki, Yannis Manolopoulos, Alexandros Nan...