1243 search results - page 159 / 249 » Complexity reduction of C-Algorithm |
115
click to vote
IDEAL
2004
Springer
15 years 6 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
CRYPTO
2003
Springer
15 years 6 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
111
click to vote
ISCA
2002
IEEE
15 years 6 months ago
2002
IEEE
Exponential growth in the number of on-chip transistors, coupled with reductions in voltage levels, makes each generation of microprocessors increasingly vulnerable to transient f...
113
click to vote
KDD
2009
ACM
15 years 6 months ago
2009
ACM
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
118
click to vote
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...