The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
—With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PD...