Sciweavers

2542 search results - page 76 / 509
» One step ahead
Sort
View
WG
2004
Springer
14 years 2 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
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...
Mordecai J. Golin, Yiu-Cho Leung
HICSS
2003
IEEE
112views Biometrics» more  HICSS 2003»
14 years 2 months ago
Assessments of Usability Engineering Processes: Experiences from Experiments
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...
Timo Jokela
ISCAS
2003
IEEE
93views Hardware» more  ISCAS 2003»
14 years 2 months ago
A rescheduling and fast pipeline VLSI architecture for lifting-based discrete wavelet transform
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...
Bing-Fei Wu, Chung-Fu Lin
SSIAI
2002
IEEE
14 years 2 months ago
Nested Partitions Using Texture Segmentation
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...
V. Lakshmanan, Victor E. DeBrunner, R. Rabin
IPPS
1999
IEEE
14 years 1 months ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
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...