Sciweavers

83 search results - page 11 / 17
» Upper bounds on maximum likelihood for phylogenetic trees
Sort
View
ICML
2008
IEEE
14 years 11 months ago
Estimating local optimums in EM algorithm over Gaussian mixture model
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
ICDCS
2010
IEEE
14 years 2 months ago
P2P Streaming Capacity under Node Degree Bound
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
Shao Liu, Minghua Chen, Sudipta Sengupta, Mung Chi...
TIT
2011
149views more  TIT 2011»
13 years 5 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
BMCBI
2004
94views more  BMCBI 2004»
13 years 10 months ago
GASP: Gapped Ancestral Sequence Prediction for proteins
Background: The prediction of ancestral protein sequences from multiple sequence alignments is useful for many bioinformatics analyses. Predicting ancestral sequences is not a sim...
Richard J. Edwards, Denis C. Shields
COCOON
2006
Springer
14 years 2 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia