316 search results - page 45 / 64 » Bounded Depth Data Trees |
IDEAL
2005
Springer
14 years 2 months ago
2005
Springer
Recently, there has been a considerable research activity in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, the ...
HASKELL
2008
ACM
13 years 10 months ago
2008
ACM
The “zipper” is a well known design pattern for providing a cursorlike interface to a data structure. However, the classic treatise by Huet only scratches the surface of some ...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
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(...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
DEXAW
2007
IEEE
14 years 1 months ago
2007
IEEE
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...