Sciweavers

2107 search results - page 100 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
128
Voted
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
16 years 9 days ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...
PDCN
2004
15 years 4 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
ECCV
2008
Springer
16 years 5 months ago
Face Alignment Via Component-Based Discriminative Search
In this paper, we propose a component-based discriminative approach for face alignment without requiring initialization1 . Unlike many approaches which locally optimize in a small ...
Lin Liang, Rong Xiao, Fang Wen, Jian Sun
DAC
1997
ACM
15 years 7 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar
SI3D
2010
ACM
15 years 10 months ago
Parallel Banding Algorithm to compute exact distance transform with the GPU
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...
Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng T...