4860 search results - page 29 / 972 » SNPs Problems, Complexity, and Algorithms |
JCST
2010
13 years 2 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
JMM2
2008
13 years 7 months ago
2008
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
ICTAI
2003
IEEE
14 years 25 days ago
2003
IEEE
Coalition formation has become a key topic in multiagent research. In this paper, we propose a preliminary classification for the coalition formation problem based on three drivin...
MOC
2002
13 years 7 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...