Sciweavers

138 search results - page 10 / 28
» K-Nearest Neighbor Search for Moving Query Point
Sort
View
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 7 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
SSDBM
2008
IEEE
181views Database» more  SSDBM 2008»
14 years 1 months ago
Monitoring Aggregate k-NN Objects in Road Networks
Abstract. In recent years, there is an increasing need to monitor k nearest neighbor (k-NN) in a road network. There are existing solutions on either monitoring k-NN objects from a...
Lu Qin, Jeffrey Xu Yu, Bolin Ding, Yoshiharu Ishik...
CIKM
2010
Springer
13 years 2 months ago
Modeling betweenness for question answering
The gap between the user's information need and query is expanding due to the pervasiveness of Web search. Multimedia question answering is restricted by disjoint infrastruct...
Brandeis Marshall