77 search results - page 3 / 16 » Optimal leaf ordering of complete binary trees |
118
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
145
click to vote
VMV
2001
15 years 3 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
161
click to vote
ICANN
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. This paper presents a neural network tree regression system with dynamic optimization of input variable transformations and post-training optimization. The decision tree ...
118
Voted
SSPR
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Recently, a number of authors have explored the use of recursive recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most...
122
Voted
DASFAA
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...