14403 search results - page 116 / 2881 » Dynamical Systems Trees |
AMC
2000
14 years 9 months ago
2000
We study a class of discrete dynamical systems that is motivated by the generic structure of simulations. The systems consist of the following data: (a) a
DAWAK
2001
Springer
15 years 2 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...
SODA
2010
ACM
15 years 7 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...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
ACL2
2006
ACM
15 years 4 months ago
2006
ACM
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...