1099 search results - page 95 / 220 » On the Complexity of Computing Evolutionary Trees |
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
109
click to vote
TON
2002
14 years 9 months ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
100
click to vote
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
ICDT
2010
ACM
15 years 2 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
This paper reports on steps that have been taken to enhance previously presented evolutionary sound matching work. In doing so, the convergence characteristics are shown to provide...