Sciweavers

1722 search results - page 141 / 345
» Variables in Concept Graphs
Sort
View
128
Voted
ICCS
1998
Springer
15 years 8 months ago
Handling Specification Knowledge Evolution Using Context Lattices
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
Aldo de Moor, Guy W. Mineau
184
Voted
AGTIVE
2007
Springer
15 years 7 months ago
Visualization, Simulation and Analysis of Reconfigurable Systems
Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanc...
Claudia Ermel, Karsten Ehrig
165
Voted
ECAI
2008
Springer
15 years 5 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...
150
Voted
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
16 years 3 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
145
Voted
DAM
2007
107views more  DAM 2007»
15 years 3 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...