16430 search results - page 463 / 3286 » On Computable Tree Functions |
210
click to vote
AMAST
2008
Springer
15 years 9 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
176
click to vote
CIKM
2008
Springer
15 years 9 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
194
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
193
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
225
click to vote
IAJIT
2011
14 years 10 months ago
2011
: The core of a parallel processing system is the interconnection network by which the system’s processors are linked. Due to the great role played by the interconnection network...