Sciweavers

515 search results - page 43 / 103
» A Reduced Complexity Algorithm for Minimizing N-Detect Tests
Sort
View
VTS
2003
IEEE
127views Hardware» more  VTS 2003»
14 years 1 months 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...
PAMI
2006
143views more  PAMI 2006»
13 years 8 months ago
Variational Bayes for Continuous Hidden Markov Models and Its Application to Active Learning
In this paper we present a variational Bayes (VB) framework for learning continuous hidden Markov models (CHMMs), and we examine the VB framework within active learning. Unlike a ...
Shihao Ji, Balaji Krishnapuram, Lawrence Carin
CEC
2007
IEEE
14 years 14 days ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben
IJCAI
2007
13 years 10 months ago
Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters
— Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. ...
Volker Nannen, A. E. Eiben
IEEEMSP
2002
IEEE
14 years 1 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...