115 search results - page 5 / 23 » Versioning Tree Structures by Path-Merging |
JEA
2008
15 years 1 months ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
ICLP
1992
Springer
15 years 5 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
106
click to vote
IFL
1997
Springer
15 years 5 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
110
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
LREC
2008
15 years 2 months ago
2008
We present the second version of the Penn Discourse Treebank, PDTB-2.0, describing its lexically-grounded annotations of discourse s and their two abstract object arguments over t...