1798 search results - page 126 / 360 » A Tree for All Seasons |
178
click to vote
DAWAK
2001
Springer
15 years 11 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
174
click to vote
NETWORKING
2004
15 years 7 months ago
2004
Subset Difference Revocation (SDR) [8] has been proposed to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message ove...
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
164
click to vote
CLASSIFICATION
2006
15 years 6 months ago
2006
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
155
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...