Sciweavers

1466 search results - page 33 / 294
» Completeness of the Authentication Tests
Sort
View
STACS
2010
Springer
14 years 2 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen
BMCBI
2006
140views more  BMCBI 2006»
13 years 7 months ago
MACSIMS : multiple alignment of complete sequences information management system
Background: In the post-genomic era, systems-level studies are being performed that seek to explain complex biological systems by integrating diverse resources from fields such as...
Julie D. Thompson, Arnaud Muller, Andrew M. Waterh...
ESEM
2007
ACM
13 years 9 months ago
Assessing, Comparing, and Combining Statechart- based testing and Structural testing: An Experiment
An important number of studies have addressed the importance of models in software engineering, mainly in the design of robust software systems. Although models have been proven t...
Samar Mouchawrab, Lionel C. Briand, Yvan Labiche
VLSID
2005
IEEE
131views VLSI» more  VLSID 2005»
14 years 8 months ago
Efficient Space/Time Compression to Reduce Test Data Volume and Testing Time for IP Cores
Abstract-- We present two-dimensional (space/time) compression techniques that reduce test data volume and test application time for scan testing of intellectual property (IP) core...
Lei Li, Krishnendu Chakrabarty, Seiji Kajihara, Sh...
ICCAD
2005
IEEE
113views Hardware» more  ICCAD 2005»
14 years 4 months ago
Synthesis methodology for built-in at-speed testing
We discuss a new synthesis flow, which offers the ability to do easy delay testing almost free in terms of its impact on speed and area as compared to corresponding implementation...
Yinghua Li, Alex Kondratyev, Robert K. Brayton