Sciweavers

1711 search results - page 7 / 343
» Completing pseudojump operators
Sort
View
SETA
2010
Springer
175views Mathematics» more  SETA 2010»
13 years 6 months ago
New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences
A Hadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three...
Krystal Guo, Guang Gong
HPCA
2002
IEEE
14 years 8 months ago
Using Complete Machine Simulation for Software Power Estimation: The SoftWatt Approach
Power dissipation has become one of the most critical factors for the continued development of both high-end and low-end computer systems. The successful design and evaluation of ...
Sudhanva Gurumurthi, Anand Sivasubramaniam, Mary J...
ASAP
2008
IEEE
146views Hardware» more  ASAP 2008»
14 years 2 months ago
A multi-FPGA application-specific architecture for accelerating a floating point Fourier Integral Operator
Many complex systems require the use of floating point arithmetic that is exceedingly time consuming to perform on personal computers. However, floating point operators are also h...
Jason Lee, Lesley Shannon, Matthew J. Yedlin, Gary...
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 2 months ago
On the regularity of iterated hairpin completion of a single word
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
SOFSEM
2012
Springer
12 years 3 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki