Sciweavers

3690 search results - page 309 / 738
» Computation with classical sequents
Sort
View
BIRTHDAY
2010
Springer
15 years 5 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller
139
Voted
ICASSP
2010
IEEE
15 years 5 months ago
A general formalism for the analysis of distributed algorithms
The major contribution of this paper is the presentation of a general unifying description of distributed algorithms allowing to map local, node-based, algorithms onto a single gl...
Ondrej Sluciak, Thibault Hilaire, Markus Rupp
ICPR
2010
IEEE
15 years 5 months ago
The Balanced Accuracy and Its Posterior Distribution
—Evaluating the performance of a classification algorithm critically requires a measure of the degree to which unseen examples have been identified with their correct class lab...
Kay Henning Brodersen, Cheng Soon Ong, Klaas Enno ...
ICPR
2010
IEEE
15 years 5 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil
ICPR
2010
IEEE
15 years 5 months ago
Adaptive Incremental Learning with an Ensemble of Support Vector Machines
The incremental updating of classifiers implies that their internal parameter values can vary according to incoming data. As a result, in order to achieve high performance, incre...
Marcelo N. Kapp, Robert Sabourin, Patrick Maupin