Sciweavers

6045 search results - page 385 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DCC
2006
IEEE
16 years 7 months ago
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
Khoongming Khoo, Guang Gong, Douglas R. Stinson
BIOINFORMATICS
2006
130views more  BIOINFORMATICS 2006»
15 years 7 months ago
Memory efficient folding algorithms for circular RNA secondary structures
A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward ...
Ivo L. Hofacker, Peter F. Stadler
DAC
2006
ACM
16 years 8 months ago
Optimal cell flipping in placement and floorplanning
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
Chiu-Wing Sham, Evangeline F. Y. Young, Chris C. N...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
16 years 2 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
ICIP
2006
IEEE
16 years 9 months ago
Multichannel Autofocus Algorithm for Synthetic Aperture Radar
The autofocus problem in synthetic aperture radar (SAR) is considered, where phase errors in the acquired signal data result in imagery that is improperly focused. We present a ne...
Robert L. Morrison Jr., Minh N. Do