Sciweavers

441 search results - page 32 / 89
» A Method for Proving Observational Equivalence
Sort
View
AAAI
1990
13 years 10 months ago
Very Fast Decision Table Execution of Propositional Expert Systems
A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expe...
Robert M. Colomb, Charles Y. C. Chung
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 9 months ago
LSMR: An iterative algorithm for sparse least-squares problems
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
David Fong, Michael Saunders
FM
2006
Springer
134views Formal Methods» more  FM 2006»
14 years 15 days ago
Formal Verification of a C Compiler Front-End
This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source an...
Sandrine Blazy, Zaynah Dargaye, Xavier Leroy
ICDCSW
2000
IEEE
14 years 13 days ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen
NIPS
2004
13 years 10 months ago
Nonlinear Blind Source Separation by Integrating Independent Component Analysis and Slow Feature Analysis
In contrast to the equivalence of linear blind source separation and linear independent component analysis it is not possible to recover the original source signal from some unkno...
Tobias Blaschke, Laurenz Wiskott