798 search results - page 25 / 160 » Proving More Properties with Bounded Model Checking |
COLT
2004
Springer
14 years 2 months ago
2004
Springer
The main goal of this paper is to prove inequalities on the reconstruction error for Kernel Principal Component Analysis. With respect to previous work on this topic, our contribu...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
ECOOPW
1999
Springer
14 years 1 months ago
1999
Springer
This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed app...
ASE
2004
13 years 8 months ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
SEFM
2009
IEEE
14 years 3 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...