307 search results - page 51 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
ESA
2003
Springer
14 years 19 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
MOBICOM
2009
ACM
14 years 1 months ago
2009
ACM
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
BMCBI
2010
13 years 7 months ago
2010
Background: Conserved gene clusters are groups of genes that are located close to one another in the genomes of several species. They tend to code for proteins that have a functio...
BMCBI
2010
13 years 2 months ago
2010
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...