4860 search results - page 190 / 972 » SNPs Problems, Complexity, and Algorithms |
STOC
2009
ACM
14 years 11 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
AUSDM
2008
Springer
14 years 11 days ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
CIBCB
2005
IEEE
14 years 4 months ago
2005
IEEE
— In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of memetic algori...
ICFEM
2009
Springer
13 years 8 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
OL
2011
13 years 5 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...