Sciweavers

2899 search results - page 3 / 580
» Dynamic Trees in Practice
Sort
View
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
13 years 9 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
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...
Johannes Fischer, Volker Heun
INFOSCALE
2006
ACM
13 years 11 months ago
Scheduling divisible loads in the dynamic heterogeneous grid environment
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...
Tao Zhu, Yongwei Wu, Guangwen Yang
ISPD
2000
ACM
126views Hardware» more  ISPD 2000»
13 years 10 months ago
A practical clock tree synthesis for semi-synchronous circuits
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 ...
Masahiko Toyonaga, Keiichi Kurokawa, Takuya Yasui,...
PARELEC
2002
IEEE
13 years 10 months ago
Dynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
Pawel Czarnul
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 6 months ago
Mining optimal decision trees from itemset lattices
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...
Élisa Fromont, Siegfried Nijssen