Transitive Nearest Neighbor Search in Mobile Environments

Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) E¸ S x R such that the total distance from p to s and then to r, i.e., dis(p, s) + dis(s, r), is minimum. We propose various algori...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHENG, Baihua, LEE, Ken C. K., LEE, Wang-Chien
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2007
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/527
http://dx.doi.org/10.1109/SUTC.2006.138
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Similar Items