3020 search results - page 59 / 604 » Optimal partition trees |
159
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
149
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
157
click to vote
FCT
2001
Springer
15 years 10 months ago
2001
Springer
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
162
click to vote
PR
2008
15 years 5 months ago
2008
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
151
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...