In many applications transactions between the elements of an information hierarchy occur over time. For example, the product offers of a department store can be organized into pro...
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships...
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...