Sciweavers

1449 search results - page 216 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
ICASSP
2008
IEEE
16 years 18 days ago
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
George N. Karystinos, Athanasios P. Liavas
ISMVL
2008
IEEE
148views Hardware» more  ISMVL 2008»
16 years 17 days ago
Quantum Logic Implementation of Unary Arithmetic Operations
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
Mitchell A. Thornton, David W. Matula, Laura Spenn...
CEC
2007
IEEE
16 years 15 days ago
Plateaus can be harder in multi-objective optimization
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
CISS
2007
IEEE
16 years 15 days ago
Detecting Information Flows: Improving Chaff Tolerance by Joint Detection
— The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant ...
Ting He, Lang Tong
DATE
2007
IEEE
102views Hardware» more  DATE 2007»
16 years 15 days ago
Accurate and scalable reliability analysis of logic circuits
Reliability of logic circuits is emerging as an important concern that may limit the benefits of continued scaling of process technology and the emergence of future technology al...
Mihir R. Choudhury, Kartik Mohanram