Sciweavers

5 search results - page 1 / 1
» Fully dynamic metric access methods based on hyperplane part...
Sort
View
IS
2011
12 years 10 months ago
Fully dynamic metric access methods based on hyperplane partitioning
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...
Gonzalo Navarro, Roberto Uribe Paredes
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
13 years 10 months ago
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
Roberto Uribe Paredes, Gonzalo Navarro
SISAP
2010
IEEE
149views Data Mining» more  SISAP 2010»
13 years 2 months ago
On applications of parameterized hyperplane partitioning
The efficient similarity search in metric spaces is usually based on several low-level partitioning principles, which allow filtering of non-relevant objects during the search. I...
Jakub Lokoc, Tomás Skopal
SBBD
2007
148views Database» more  SBBD 2007»
13 years 5 months ago
Bulk-loading Dynamic Metric Access Methods
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
Thiago Galbiatti Vespa, Caetano Traina Jr., Agma J...
BMCBI
2006
155views more  BMCBI 2006»
13 years 3 months ago
CAVER: a new tool to explore routes from protein clefts, pockets and cavities
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, ...
Martin Petrek, Michal Otyepka, Pavel Banás,...