We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
Search trails mined from browser or toolbar logs comprise queries and the post-query pages that users visit. Implicit endorsements from many trails can be useful for search result...
Abstract—Information interaction is a crucial part of modern transportation activities. In this paper, we propose the idea of Vehicle-to-Passenger communication (V2P), which allo...
Nianbo Liu, Ming Liu, Jiannong Cao, Guihai Chen, W...
Throughout many of the different types of Web searches people perform, the primary tasks are to first craft a query that effectively captures their information needs, and then eva...
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...