We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
In this paper, we propose a novel cache consistency maintenance scheme, called Ë Ð Ð ×ÝÒ ÖÓÒÓÙ× ÓÒ× ×Ø Ò Ý Ë Ñ (SACCS), for mobile environments. It relies on ...
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
— This paper envisions a shared virtual reality system that could handle millions of users and objets. The SOLIPSIS system does not rely on servers and is based on a network of p...
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...