Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
The class of k Nearest Neighbor (kNN) queries in spatial networks is extensively studied in the context of numerous applications. In this paper, for the first time we study a gene...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...
As the volume of multimedia data available on internet is tremendously increasing, the content-based similarity search becomes a popular approach to multimedia retrieval. The most...