Sciweavers

14 search results - page 1 / 3
» Slim-Trees: High Performance Metric Trees Minimizing Overlap...
Sort
View
EDBT
2000
ACM
13 years 8 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
SBBD
2004
89views Database» more  SBBD 2004»
13 years 6 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
ICDCS
2006
IEEE
13 years 10 months ago
High-Throughput Multicast Routing Metrics in Wireless Mesh Networks
The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to findi...
Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra ...
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 6 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
ICIP
2000
IEEE
14 years 6 months ago
Image Registration with Minimum Spanning Tree Algorithm
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
Bing Ma, Alfred O. Hero III, John D. Gorman, Olivi...