276 search results - page 2 / 56 » Fast Algorithm for Stochastic Tree Computation |
CN
2008
13 years 5 months ago
2008
WEA
2010
Springer
13 years 11 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
ICAART
2010
INSTICC
14 years 2 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, ...