Sciweavers

2218 search results - page 115 / 444
» Testing Expressibility Is Hard
Sort
View
FSTTCS
2009
Springer
14 years 3 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
BMCBI
2007
148views more  BMCBI 2007»
13 years 9 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...
ATS
2003
IEEE
98views Hardware» more  ATS 2003»
14 years 2 months ago
Automatic Design Validation Framework for HDL Descriptions via RTL ATPG
We present a framework for high-level design validation using an efficient register-transfer level (RTL) automatic test pattern generator (ATPG). The RTL ATPG generates the test ...
Liang Zhang, Michael S. Hsiao, Indradeep Ghosh
ACMACE
2007
ACM
14 years 1 months ago
Graceful anytime interruptibility for virtual agents
The demo will show two highly expressive virtual agents introducing the audience to a traditional Japanese room. The agent models and gestures have been created by a professional ...
Klaus Brügmann, Helmut Prendinger, Marc Stamm...
IFIP13
2004
13 years 10 months ago
Formal Verification and Validation of Interactive Systems Specifications
: This paper proposes a development process for interactive systems based both on verification and validation methods. Our approach is formal and use at first the B Method. We show...
Yamine Aït Ameur, Benoit Breholée, Pat...