820 search results - page 10 / 164 » Finding low-utility data structures |
IMCSIT
2010
13 years 6 months ago
2010
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...
MICS
2010
13 years 7 months ago
2010
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...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
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...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
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...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
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 ...