Sciweavers

9572 search results - page 418 / 1915
» Cover Algorithms and Their Combination
Sort
View
AMFG
2003
IEEE
151views Biometrics» more  AMFG 2003»
16 years 4 days ago
Illumination Modeling and Normalization for Face Recognition
In this paper, we present a general framework for face modeling under varying lighting conditions. First, we show that a face lighting subspace can be constructed based on three o...
Haitao Wang, Stan Z. Li, Yangsheng Wang, Weiwei Zh...
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
16 years 3 days ago
A novel improvement technique for high-level test synthesis
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
Saeed Safari, Hadi Esmaeilzadeh, Amir-Hossein Jaha...
IWSOC
2003
IEEE
104views Hardware» more  IWSOC 2003»
16 years 3 days ago
IP Watermarking Techniques: Survey and Comparison
— Intellectual property (IP) block reuse is essential for facilitating the design process of System-on-a-Chip. Sharing IP blocks in such a competitive market poses significant h...
Amr T. Abdel-Hamid, Sofiène Tahar, El Mosta...
VTS
2003
IEEE
127views Hardware» more  VTS 2003»
16 years 3 days ago
Bist Reseeding with very few Seeds
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
FCT
2003
Springer
16 years 1 days ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith