1099 search results - page 28 / 220 » On the Complexity of Computing Evolutionary Trees |
254
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
120
click to vote
JACM
2000
15 years 4 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
127
click to vote
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
129
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
126
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...