Sciweavers

251 search results - page 29 / 51
» When Is Nearest Neighbors Indexable
Sort
View
PAMI
2006
132views more  PAMI 2006»
13 years 8 months ago
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
We propose a new method for rapid 3D object indexing that combines feature-based methods with coarse alignment-based matching techniques. Our approach achieves a sublinear complexi...
Bogdan Matei, Ying Shan, Harpreet S. Sawhney, Yi T...
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 8 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 8 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
DMSN
2004
ACM
14 years 2 months ago
KPT: a dynamic KNN query processing algorithm for location-aware sensor networks
An important type of spatial queries for sensor networks are K Nearest Neighbor (KNN) queries. Currently, research proposals for KNN query processing is based on index structures,...
Julian Winter, Wang-Chien Lee
GEOINFORMATICA
2006
103views more  GEOINFORMATICA 2006»
13 years 8 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...