Sciweavers

613 search results - page 7 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
TCBB
2010
166views more  TCBB 2010»
13 years 5 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
13 years 7 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Hiroshi Fujiwara, Tobias Jacobs
ICCS
2004
Springer
14 years 2 days ago
Advanced Multicasting for DVBMT Solution
Our research subject in the present paper is concerned with the minimization of multicast delay variation under the multicast endto-end delay constraint. The delay- and delay varia...
Moonseong Kim, Young-Cheol Bang, Hyunseung Choo
FSTTCS
2004
Springer
14 years 2 days ago
Decidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
Angelo Montanari, Gabriele Puppis
ISMIS
2011
Springer
12 years 9 months ago
An Evolutionary Algorithm for Global Induction of Regression Trees with Multivariate Linear Models
In the paper we present a new evolutionary algorithm for induction of regression trees. In contrast to the typical top-down approaches it globally searches for the best tree struct...
Marcin Czajkowski, Marek Kretowski