Sciweavers

4242 search results - page 502 / 849
» An Event Spacing Experiment
Sort
View
ACCV
2006
Springer
16 years 26 days ago
Fast Approximated SIFT
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
Michael Grabner, Helmut Grabner, Horst Bischof
ASPDAC
2006
ACM
97views Hardware» more  ASPDAC 2006»
16 years 26 days ago
Object duplication for improving reliability
— Soft errors are becoming a common problem in current systems due to the scaling of technology that results in the use of smaller devices, lower voltages, and power-saving techn...
Guilin Chen, Mahmut T. Kandemir, Narayanan Vijaykr...
ASPDAC
2006
ACM
146views Hardware» more  ASPDAC 2006»
16 years 26 days ago
A fixed-die floorplanning algorithm using an analytical approach
— Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the t...
Yong Zhan, Yan Feng, Sachin S. Sapatnekar
MM
2006
ACM
120views Multimedia» more  MM 2006»
16 years 25 days ago
Mapping learning in eigenspace for harmonious caricature generation
This paper proposes a mapping learning approach for caricature auto-generation. Simulating the artist’s creativity based on the object’s facial feature, our approach targets d...
Junfa Liu, Yiqiang Chen, Wen Gao
CEC
2005
IEEE
16 years 15 days ago
Evolving dispatching rules for solving the flexible job-shop problem
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
Nhu Binh Ho, Joc Cing Tay