Sciweavers

1284 search results - page 74 / 257
» Data Structures for Mergeable Trees
Sort
View
ECCV
2004
Springer
14 years 1 months ago
Assessment of Intrathoracic Airway Trees: Methods and In Vivo Validation
Abstract. A method for quantitative assessment of tree structures is reported allowing evaluation of airway tree morphology and its associated function. Our skeletonization and bra...
Kálmán Palágyi, Juerg Tschirr...
IS
2011
13 years 2 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
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
13 years 11 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 10 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
13 years 11 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein