Sciweavers

222 search results - page 18 / 45
» Efficient assertion based verification using TLM
Sort
View
AMAI
2004
Springer
15 years 5 months ago
Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
Miroslav N. Velev
AUSAI
2006
Springer
15 years 1 months ago
An Efficient Alternative to SVM Based Recursive Feature Elimination with Applications in Natural Language Processing and Bioinfo
The SVM based Recursive Feature Elimination (RFE-SVM) algorithm is a popular technique for feature selection, used in natural language processing and bioinformatics. Recently it wa...
Justin Bedo, Conrad Sanderson, Adam Kowalczyk
CCS
2008
ACM
15 years 1 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
JCP
2007
214views more  JCP 2007»
14 years 11 months ago
Reconstruction of 3D Human Facial Images Using Partial Differential Equations
—One of the challenging problems in geometric modeling and computer graphics is the construction of realistic human facial geometry. Such geometry are essential for a wide range ...
Eyad Elyan, Hassan Ugail
AMAST
2008
Springer
15 years 1 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...