2899 search results - page 22 / 580 » Dynamic Trees in Practice |
ESA
1999
Springer
15 years 4 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
125
click to vote
COLING
2008
15 years 1 months ago
2008
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...
179
click to vote
Book
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This
book provides an introduction to binary tree techniques and presents all of Libavl’s ...
EMMCVPR
2001
Springer
15 years 4 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
104
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...