Sciweavers

575 search results - page 16 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
ICDCS
2006
IEEE
14 years 1 months ago
On Scheduling Expansive and Reductive Dags for Internet-Based Computing
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Ros...
IPPS
2006
IEEE
14 years 1 months ago
Phylogenetic models of rate heterogeneity: a high performance computing perspective
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
Alexandros Stamatakis
ICC
2007
IEEE
111views Communications» more  ICC 2007»
14 years 1 months ago
Computationally Efficient Optimal Discrete Bit Allocation for Medium and High Target Bit Rate DMT Transmissions
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
Li-ping Zhu, Xiaofeng Zhong, Yan Yao, Shi-wei Dong...
CCECE
2006
IEEE
14 years 1 months ago
Dynamic and Parallel Approaches to Optimal Evolutionary Tree Construction
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
Anupam Bhattacharjee, Kazi Zakia Sultana, Zalia Sh...
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
13 years 7 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...