Sciweavers

3946 search results - page 12 / 790
» The computational complexity of choice sets
Sort
View
BMCBI
2006
108views more  BMCBI 2006»
13 years 9 months ago
Probe set algorithms: is there a rational best bet?
Affymetrix microarrays have become a standard experimental platform for studies of mRNA expression profiling. Their success is due, in part, to the multiple oligonucleotide featur...
Jinwook Seo, Eric P. Hoffman
DCC
2006
IEEE
14 years 9 months ago
Efficient Computation of Roots in Finite Fields
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
Paulo S. L. M. Barreto, José Felipe Voloch
ARITH
2001
IEEE
14 years 1 months ago
Computer Arithmetic-A Processor Architect's Perspective
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
Ruby B. Lee
IANDC
2010
67views more  IANDC 2010»
13 years 8 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
IEAAIE
1998
Springer
14 years 2 months ago
Complexity and Cognitive Computing
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
Lourdes Mattos Brasil, Fernando Mendes de Azevedo,...