Sciweavers

439 search results - page 64 / 88
» Choiceless Computation and Symmetry
Sort
View
ICPADS
2006
IEEE
15 years 3 months ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
ISCAS
2006
IEEE
79views Hardware» more  ISCAS 2006»
15 years 3 months ago
A low-power 64-point FFT/IFFT design for IEEE 802.11a WLAN application
—In this paper, we propose a cost-effective and low-power 64-point fast Fourier transform (FFT)/inverse FFT (IFFT) architecture and chip adopting the retrenched 8-point FFT/IFFT ...
Chin-Teng Lin, Yuan-Chu Yu, Lan-Da Van
3DIM
2005
IEEE
15 years 3 months ago
Semi-Automatic Range to Range Registration: A Feature-Based Method
Our goal is the production of highly accurate photorealistic descriptions of the 3D world with a minimum of human interaction and increased computational efficiency. Our input is...
Chen Chao, Ioannis Chao
LCN
2005
IEEE
15 years 3 months ago
Performance Analysis of Multi-Fiber Synchronous Photonic Share-per-link Packet Switches
A performance model is presented for an optical packet switch architecture in which the wavelength converters are shared per output link and each output link consists of multiple ...
Ayman G. Fayoumi, Fahad A. Al-Zahrani, Abdulgader ...
88
Voted
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 3 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang