Sciweavers

681 search results - page 55 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
IEEEPACT
2007
IEEE
15 years 4 months ago
Verification-Aware Microprocessor Design
The process of verifying a new microprocessor is a major problem for the computer industry. Currently, architects design processors to be fast, power-efficient, and reliable. Howe...
Anita Lungu, Daniel J. Sorin
ICALP
2009
Springer
15 years 10 months ago
Decidability of Conjugacy of Tree-Shifts of Finite Type
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
Nathalie Aubrun, Marie-Pierre Béal
BMCBI
2008
178views more  BMCBI 2008»
14 years 10 months ago
A discriminative method for protein remote homology detection and fold recognition combining Top-n-grams and latent semantic ana
Background: Protein remote homology detection and fold recognition are central problems in bioinformatics. Currently, discriminative methods based on support vector machine (SVM) ...
Bin Liu, Xiaolong Wang, Lei Lin, Qiwen Dong, Xuan ...
FDL
2006
IEEE
15 years 3 months ago
Bridging the Gap Between SysML and Design Space Exploration
In the last few years the embedded systems design discipline required new design methodologies and new specification languages to support system engineers in developing heterogen...
Mauro Prevostini, Sivakumar Ganesan
ICALP
2005
Springer
15 years 3 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin