Sciweavers

2880 search results - page 7 / 576
» Approximate Range Searching
Sort
View
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
IJCNN
2007
IEEE
14 years 1 months ago
Range Data Approximation for Mobile Robot by Using CAN2
— In this article, we apply the competitive associative net called CAN2 to the processing of the range data of indoor environment acquired by a mobile robot, where the CAN2 is a ...
Takeshi Nishida, Shuichi Kurogi, Yuji Takemura, Hi...
ICMCS
2005
IEEE
132views Multimedia» more  ICMCS 2005»
14 years 29 days ago
Approximating the selectivity of multimedia range queries
This paper introduces a new approach of approximating the selectivity of multimedia range queries. Estimating the selectivity of a range query is a pre-requisite to optimize a mul...
Mario Döller, Harald Kosch