Sciweavers

163 search results - page 9 / 33
» K-Nearest Neighbor Search using the Pyramid Technique
Sort
View
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 7 months ago
Monitoring path nearest neighbor in road networks
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...
ICASSP
2011
IEEE
12 years 11 months ago
An inner-product lower-bound estimate for dynamic time warping
In this paper, we present a lower-bound estimate for dynamic time warping (DTW) on time series consisting of multi-dimensional posterior probability vectors known as posteriorgram...
Yaodong Zhang, James R. Glass
IJCNLP
2004
Springer
14 years 23 days ago
A Study of Semi-discrete Matrix Decomposition for LSI in Automated Text Categorization
Abstract. This paper proposes the use of Latent Semantic Indexing (LSI) techniques, decomposed with semi-discrete matrix decomposition (SDD) method, for text categorization. The SD...
Qiang Wang, Xiaolong Wang, Guan Yi
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 8 months ago
SpaceTwist: Managing the Trade-Offs Among Location Privacy, Query Performance, and Query Accuracy in Mobile Services
In a mobile service scenario, users query a server for nearby points of interest but they may not want to disclose their locations to the service. Intuitively, location privacy may...
Man Lung Yiu, Christian S. Jensen, Xuegang Huang, ...
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...