Sciweavers

19 search results - page 1 / 4
» Subwords in reverse-complement order
Sort
View
DAGSTUHL
2006
13 years 6 months ago
Subwords in reverse-complement order
We examine finite words over an alphabet = {a,
Péter L. Erdös, Péter Ligeti, P...
DSD
2009
IEEE
148views Hardware» more  DSD 2009»
13 years 11 months ago
SIMD Architectural Enhancements to Improve the Performance of the 2D Discrete Wavelet Transform
—The 2D Discrete Wavelet Transform (DWT) is a time-consuming kernel in many multimedia applications such as JPEG2000 and MPEG-4. The 2D DWT consists of horizontal filtering alon...
Asadollah Shahbahrami, Ben H. H. Juurlink
ICCD
2001
IEEE
120views Hardware» more  ICCD 2001»
14 years 1 months ago
Architectural Enhancements for Fast Subword Permutations with Repetitions in Cryptographic Applications
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...
John Patrick McGregor, Ruby B. Lee
IJAC
2011
12 years 8 months ago
The Subword Reversing Method
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
Patrick Dehornoy
COMBINATORICS
2006
115views more  COMBINATORICS 2006»
13 years 5 months ago
Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
Catalin Zara