Sciweavers

402 search results - page 40 / 81
» Nearest Surrounder Queries
Sort
View
GIS
2005
ACM
14 years 8 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 17 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
SSD
2001
Springer
112views Database» more  SSD 2001»
14 years 5 days ago
K-Nearest Neighbor Search for Moving Query Point
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
Zhexuan Song, Nick Roussopoulos
GEOINFORMATICA
2006
94views more  GEOINFORMATICA 2006»
13 years 7 months ago
Spatial Query Estimation without the Local Uniformity Assumption
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...
Yufei Tao, Christos Faloutsos, Dimitris Papadias
GEOINFORMATICA
2006
103views more  GEOINFORMATICA 2006»
13 years 7 months ago
Building and Querying a P2P Virtual World
Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P app...
Egemen Tanin, Aaron Harwood, Hanan Samet, Deepa Na...