Sciweavers

1237 search results - page 160 / 248
» Abstract shade trees
Sort
View
ECML
2007
Springer
14 years 4 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou
ECSQARU
2007
Springer
14 years 4 months ago
Dialectical Explanations in Defeasible Argumentation
Abstract. This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undevel...
Alejandro Javier García, Nicolás D. ...
ESOP
2007
Springer
14 years 4 months ago
Modular Shape Analysis for Dynamically Encapsulated Programs
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard ...
Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Rama...
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 4 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
14 years 4 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia