Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Documents and authors can be clustered into “knowledge communities” based on the overlap in the papers they cite. We introduce a new clustering algorithm, Streemer, which fin...
Vasileios Kandylas, S. Phineas Upham, Lyle H. Unga...
There has recently been an upsurge of interest in the possibilities of combining structured data and ad-hoc information retrieval from traditional hypertext. In this experiment, w...
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...