A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Web search and browsing have been streamlined for a comfortable experience when the network connection is fast. Existing tools, however, are not optimized for scenarios where conn...
Jay Chen, Lakshminarayanan Subramanian, Kentaro To...
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...