2634 search results - page 199 / 527 » Faster Than Uppaal |
162
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. We show how to extract existential witnesses from classical proofs using Krivine’s classical realizability—where classical proofs are interpreted as λ-terms with the...
164
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
123
click to vote
COLING
2010
15 years 1 months ago
2010
This paper proposes an efficient online method that trains a classifier with many conjunctive features. We employ kernel computation called kernel slicing, which explicitly consid...
165
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
186
click to vote
JMLR
2011
15 years 1 months ago
2011
We develop, analyze, and test a training algorithm for support vector machine classifiers without offset. Key features of this algorithm are a new, statistically motivated stoppi...