Sciweavers

813 search results - page 7 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
AGTIVE
2007
Springer
14 years 11 months ago
Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database
Abstract. The DRAGOS database eases the development of graphbased applications by providing a uniform graph-oriented data storage facility. In this paper, we extend the existing da...
Erhard Weinell
ECAI
2008
Springer
14 years 11 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
AMC
2005
145views more  AMC 2005»
14 years 9 months ago
Connectivity graphs as models of local interactions
In this paper, we study graphs that arise from certain sensory and communication limitations on the local interactions in multi-agent systems. In particular, we show that the set ...
Abubakr Muhammad, Magnus Egerstedt
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
14 years 7 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
GG
2004
Springer
15 years 3 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...