Sciweavers

70 search results - page 5 / 14
» Optimal reconstruction might be hard
Sort
View
CCECE
2006
IEEE
15 years 3 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...
TVCG
2012
218views Hardware» more  TVCG 2012»
13 years 2 days ago
Flow-Based Local Optimization for Image-to-Geometry Projection
—The projection of a photographic dataset on a 3D model is a robust and widely applicable way to acquire appearance information of an object. The first step of this procedure is...
Matteo Dellepiane, Ricardo Marroquim, Marco Callie...
COCOON
2005
Springer
15 years 3 months ago
RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer
Horizontal gene transfer (HGT) plays a major role in microbial genome diversification, and is claimed to be rampant among various groups of genes in bacteria. Further, HGT is a ma...
Luay Nakhleh, Derek A. Ruths, Li-San Wang
WWW
2006
ACM
15 years 10 months ago
WAP5: black-box performance debugging for wide-area systems
Wide-area distributed applications are challenging to debug, optimize, and maintain. We present Wide-Area Project 5 (WAP5), which aims to make these tasks easier by exposing the c...
Patrick Reynolds, Janet L. Wiener, Jeffrey C. Mogu...
MST
2007
167views more  MST 2007»
14 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...