Sciweavers

813 search results - page 89 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
CSMR
2006
IEEE
14 years 3 months ago
Dynamic Object Process Graphs
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
Jochen Quante, Rainer Koschke
IAT
2006
IEEE
14 years 3 months ago
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
Terence H.-W. Law, Adrian R. Pearce
TPHOL
2008
IEEE
14 years 3 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 3 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
ICML
2002
IEEE
14 years 10 months ago
Diffusion Kernels on Graphs and Other Discrete Input Spaces
The application of kernel-based learning algorithms has, so far, largely been confined to realvalued data and a few special data types, such as strings. In this paper we propose a...
Risi Imre Kondor, John D. Lafferty