Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
This paper is concerned with the transparent parallelisation of declarative database queries, based on theoretical principles. We have designed an entire database architecture sui...
Mohamad Afshar, J. Bates, Gavin M. Bierman, K. Moo...
This paper discusses extensions to the Rover toolkit for constructing reliable mobile-aware applications. The extensions improve upon the existing failure model, which only addres...
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...