Sciweavers

2173 search results - page 14 / 435
» On the Values of Reducibility Candidates
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 7 months ago
SPIRAL: efficient and exact model identification for hidden Markov models
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamu...
DATE
2002
IEEE
98views Hardware» more  DATE 2002»
14 years 10 days ago
A New ATPG Algorithm to Limit Test Set Size and Achieve Multiple Detections of All Faults
Deterministic observation and random excitation of fault sites during the ATPG process dramatically reduces the overall defective part level. However, multiple observations of eac...
Sooryong Lee, Brad Cobb, Jennifer Dworak, Michael ...
CISSE
2008
Springer
13 years 9 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier
WCE
2007
13 years 8 months ago
A Dynamic Method for the Evaluation and Comparison of Imputation Techniques
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Estimating the uncertainty inherent ...
Norman Solomon, Giles Oatley, Kenneth McGarry
LREC
2008
153views Education» more  LREC 2008»
13 years 8 months ago
Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
Linus Sellberg, Arne Jönsson