We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
In [1, 2] we studied various concepts of bipolar queries (cf. Dubois and Prade [3]). We advocated there the use of a fuzzified version of the original crisp definition introduced...
This paper studies the problem of memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling...
We study the problem of answering spatial queries in databases where objects exist with some uncertainty and they are associated with an existential probability. The goal of a thre...
Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei...