2899 search results - page 3 / 580 » Dynamic Trees in Practice |
124
Voted
CPM
2006
Springer
15 years 4 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
130
Voted
INFOSCALE
2006
ACM
15 years 7 months ago
2006
ACM
According to the special features of the dynamic heterogeneous grid environment, a loose-coupled and scalable resource model is described by a hybrid multi-level tree reflecting a...
105
click to vote
ISPD
2000
ACM
15 years 5 months ago
2000
ACM
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
105
Voted
PARELEC
2002
IEEE
15 years 6 months ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
117
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...