502 search results - page 32 / 101 » Verifying Balanced Trees |
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...
ADBIS
2004
Springer
14 years 4 months ago
2004
Springer
Nowadays, one of the main research issues of great interest is the efficient tracking of mobile objects that enables the effective answering of spatiotemporal queries. This line o...
DMDW
2001
14 years 10 days ago
2001
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
DAC
2005
ACM
14 years 12 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
AINA
2007
IEEE
14 years 5 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...