138 search results - page 22 / 28 » K-Nearest Neighbor Search for Moving Query Point |
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD (content-based copy detection) of images and video. They include two steps...
MDM
2007
Springer
14 years 1 months ago
2007
Springer
Several window constructs are usually specified in continuous queries over data streams as a means of limiting the amount of data processed each time and thus providing real-time...
ADBIS
2006
Springer
14 years 1 months ago
2006
Springer
In order to search similar moving object trajectories, the previously used methods focused on Euclidean distance and considered only spatial similarity. Euclidean distance is not a...
ECCV
2010
Springer
14 years 19 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...