1099 search results - page 35 / 220 » On the Complexity of Computing Evolutionary Trees |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
ACL
2003
14 years 11 months ago
2003
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...
CPM
2000
Springer
15 years 2 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
WG
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
86
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
It is well known that the affine projection algorithm (APA) offers a good tradeoff between convergence rate/tracking and computational complexity. Recently, the evolutionary APA (...