Sciweavers

83 search results - page 14 / 17
» Upper bounds on maximum likelihood for phylogenetic trees
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 8 months ago
Compact Ancestry Labeling Schemes for XML Trees
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...
Fraigniaud Pierre, Korman Amos
IPMI
2003
Springer
14 years 11 months ago
Bayesian Multimodality Non-rigid Image Registration via Conditional Density Estimation
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 ...
Jie Zhang, Anand Rangarajan
PODC
2005
ACM
14 years 4 months ago
Proof labeling schemes
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...
Amos Korman, Shay Kutten, David Peleg
ICC
2008
IEEE
120views Communications» more  ICC 2008»
14 years 5 months ago
Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
Jagadeesh Harshan, B. Sundar Rajan
FOCS
2008
IEEE
14 years 5 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
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...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...