Sciweavers

276 search results - page 20 / 56
» Fast Algorithm for Stochastic Tree Computation
Sort
View
AAAI
2006
13 years 9 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
DAC
2005
ACM
14 years 8 months ago
Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method
This paper presents a novel repeater insertion algorithm for the power minimization of realistic interconnect trees under given timing budgets. Our algorithm judiciously combines ...
Yuantao Peng, Xun Liu
ACL
2011
12 years 11 months ago
Adjoining Tree-to-String Translation
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations exp...
Yang Liu, Qun Liu, Yajuan Lü
SPAA
1998
ACM
13 years 12 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller