83 search results - page 14 / 17 » Upper bounds on maximum likelihood for phylogenetic trees |
152
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
200
click to vote
IPMI
2003
Springer
16 years 7 months ago
2003
Springer
Abstract. We present a Bayesian multimodality non-rigid image registration method. Since the likelihood is unknown in the general multimodality setting, we use a density estimator ...
174
click to vote
PODC
2005
ACM
16 years 7 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
203
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
168
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...