Sciweavers

2218 search results - page 139 / 444
» Testing Expressibility Is Hard
Sort
View
FGR
2002
IEEE
175views Biometrics» more  FGR 2002»
14 years 2 months ago
On Modeling Variations for Face Authentication
In this paper, we present a scheme for face authentication in the presence of variations. To deal with variations, such as facial expressions and registration errors, with which t...
Xiaoming Liu 0002, Tsuhan Chen, B. V. K. Vijaya Ku...
LMCS
2007
132views more  LMCS 2007»
13 years 9 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 9 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
SEUS
2010
IEEE
13 years 7 months ago
Error Detection Rate of MC/DC for a Case Study from the Automotive Domain
Chilenski and Miller [1] claim that the error detection probability of a test set with full modified condition/decision coverage (MC/DC) on the system under test converges to 100%...
Susanne Kandl, Raimund Kirner
BMCBI
2006
147views more  BMCBI 2006»
13 years 9 months ago
Grouping Gene Ontology terms to improve the assessment of gene set enrichment in microarray data
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...
Alex Lewin, Ian C. Grieve