Sciweavers

1618 search results - page 89 / 324
» Testing random number generators
Sort
View
ISPW
2008
IEEE
14 years 4 months ago
Accurate Estimates without Calibration?
Most process models calibrate their internal settings using historical data. Collecting this data is expensive, tedious, and often an incomplete process. Is it possible to make acc...
Tim Menzies, Oussama El-Rawas, Barry W. Boehm, Ray...
ICCV
2007
IEEE
14 years 4 months ago
Deformable Template As Active Basis
This article proposes an active basis model and a shared pursuit algorithm for learning deformable templates from image patches of various object categories. In our generative mod...
Ying Nian Wu, Zhangzhang Si, Chuck Fleming, Song C...
AAAI
1994
13 years 11 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
FSTTCS
2010
Springer
13 years 8 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet
VTS
1998
IEEE
97views Hardware» more  VTS 1998»
14 years 2 months ago
On the Identification of Optimal Cellular Automata for Built-In Self-Test of Sequential Circuits
This paper presents a BIST architecture for Finite State Machines that exploits Cellular Automata (CA) as pattern generators and signature analyzers. The main advantage of the pro...
Fulvio Corno, Nicola Gaudenzi, Paolo Prinetto, Mat...