Sciweavers

KSEM
2009
Springer
14 years 7 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
KSEM
2009
Springer
14 years 7 months ago
Knowledge Maturing Services: Supporting Knowledge Maturing in Organisational Environments
The changes in the dynamics of the economy and the corresponding mobility and fluctuations of knowledge workers within organizations make continuous social learning an essential f...
Karin Schoefegger, Nicolas Weber, Stefanie N. Lind...
KSEM
2009
Springer
14 years 7 months ago
On Optimization of Predictions in Ontology-Driven Situation Awareness
Systems supporting situation awareness in large-scale control systems, such as, e. g., encountered in the domain of road traffic management, pursue the vision of allowing human ope...
Norbert Baumgartner, Wolfgang Gottesheim, Stefan M...
KSEM
2009
Springer
14 years 7 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
FSTTCS
2009
Springer
14 years 7 months ago
Mediating for Reduction (on Minimizing Alternating Büchi Automata)
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Ho...
FSTTCS
2009
Springer
14 years 7 months ago
On the Memory Consumption of Probabilistic Pushdown Automata
Tomás Brázdil, Javier Esparza, Stefa...
FSTTCS
2009
Springer
14 years 7 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
FSTTCS
2009
Springer
14 years 7 months ago
Kernels for Feedback Arc Set In Tournaments
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...