Sciweavers

158 search results - page 14 / 32
» High dimensional reverse nearest neighbor queries
Sort
View
ADBIS
2007
Springer
117views Database» more  ADBIS 2007»
15 years 4 months ago
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
Tomás Skopal, David Hoksza
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 4 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
DEXA
2007
Springer
173views Database» more  DEXA 2007»
15 years 3 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
NPL
2002
103views more  NPL 2002»
14 years 9 months ago
Kernel Nearest Neighbor Algorithm
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...
Kai Yu, Liang Ji, Xuegong Zhang
ENGL
2008
160views more  ENGL 2008»
14 years 9 months ago
Vector Approximation based Indexing for High-Dimensional Multimedia Databases
With the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexi...
Imane Daoudi, Saîd El Alaoui Ouatik, A. El K...