Sciweavers

16430 search results - page 10 / 3286
» On Computable Tree Functions
Sort
View
ISMB
1996
13 years 9 months ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...
BICOB
2010
Springer
13 years 6 months ago
Iterative Split Adjustment for Building Multilabel Decision Trees
A decision tree induction method for multilabel classification tasks (IS-MLT) is presented which uses an iterative approach for determining the best split at each node. The propo...
Aiyesha Ma, Ishwar K. Sethi
CTRSA
2003
Springer
114views Cryptology» more  CTRSA 2003»
14 years 26 days ago
Fractal Merkle Tree Representation and Traversal
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
Markus Jakobsson, Frank Thomson Leighton, Silvio M...
FOCS
2009
IEEE
14 years 2 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
IPPS
2006
IEEE
14 years 1 months ago
Phylogenetic models of rate heterogeneity: a high performance computing perspective
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
Alexandros Stamatakis