Sciweavers

24 search results - page 5 / 5
» The complexity of greatest common divisor computations
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
COMPLEXITY
2004
165views more  COMPLEXITY 2004»
13 years 7 months ago
Sex promotes gamete selection: A quantitative comparative study of features favoring the evolution of sex
: Explaining the maintenance of sexual reproduction remains one of the greatest challenges in biology. The theoretical oddity of sex is based on at least three advantages that asex...
Klaus Jaffe
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 5 days ago
Initialization parameter sweep in ATHENA: optimizing neural networks for detecting gene-gene interactions in the presence of sma
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
Emily Rose Holzinger, Carrie C. Buchanan, Scott M....