5105 search results - page 161 / 1021 » An algorithm to determine peer-reviewers |
113
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
146
Voted
SPAA
1997
ACM
15 years 5 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
109
Voted
BMCBI
2008
15 years 26 days ago
2008
Background: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes ...
107
Voted
BMCBI
2007
15 years 26 days ago
2007
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
112
Voted
ARITH
1999
IEEE
1999
IEEE
Correctness Proofs Outline for Newton-Raphson Based Floating-Point Divide and Square Root Algorithms
15 years 5 months ago
This paper describes a study of a class of algorithms for the floating-point divide and square root operations, based on the Newton-Raphson iterative method. The two main goals we...