Sciweavers

4911 search results - page 106 / 983
» Tree dependence analysis
Sort
View
93
Voted
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
15 years 7 months ago
Deletion without Rebalancing in Multiway Search Trees
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...
Siddhartha Sen, Robert Endre Tarjan
98
Voted
PR
2007
81views more  PR 2007»
15 years 7 days ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
ICCV
2005
IEEE
16 years 2 months ago
Beyond Trees: Common-Factor Models for 2D Human Pose Recovery
Tree structured models have been widely used for determining the pose of a human body, from either 2D or 3D data. While such models can effectively represent the kinematic constra...
Xiangyang Lan, Daniel P. Huttenlocher
124
Voted
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
15 years 7 months ago
Rank-Balanced Trees
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...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
CSR
2007
Springer
15 years 7 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur