Sciweavers

300 search results - page 12 / 60
» Constrained Nearest Neighbor Queries
Sort
View
COCOON
1998
Springer
13 years 12 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
SSD
2007
Springer
146views Database» more  SSD 2007»
14 years 1 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi
SAC
2004
ACM
14 years 1 months ago
Similarity between Euclidean and cosine angle distance for nearest neighbor queries
Understanding the relationship among different distance measures is helpful in choosing a proper one for a particular application. In this paper, we compare two commonly used dis...
Gang Qian, Shamik Sural, Yuelong Gu, Sakti Pramani...
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
DEXA
2007
Springer
173views Database» more  DEXA 2007»
14 years 1 months ago
A P2P Technique for Continuous k-Nearest-Neighbor Query in Road Networks
Due to the high frequency in location updates and the expensive cost of continuous query processing, server computation capacity and wireless communication bandwidth are the two li...
Fuyu Liu, Kien A. Hua, Tai T. Do