We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
In the geometric data model [6], spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities. To facilitate querying an...
Some tasks vital to many mixed and augmented reality systems are either too time consuming or complex to be carried out whilst the system is active. 3D scene modelling and labelli...
In this paper, we present a new model of snow accumulation and stability for computergraphics. Our contribution is divided into two major components, each essential for modelling ...