281 search results - page 5 / 57 » Balancing weight-balanced trees |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
FLAIRS
2006
13 years 9 months ago
2006
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
CCGRID
2010
IEEE
13 years 5 months ago
2010
IEEE
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
TELSYS
2002
13 years 8 months ago
2002
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...