It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
We carried out eight assessments of usability engineering processes in four industrial companies, for the purpose of providing a basis for process improvement. The research method...
In this paper, we propose a fast pipeline VLSI architecture for 1D lifting-based discrete wavelet transform (DWT). This design method merges the filtering steps called the predict...
A multi-step method of partitioning the pixels of an image such that the partitions at one step are wholly nested inside the partitions of the next step is described, i.e. we desc...
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...