Abstract. The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-...
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...