Sciweavers

866 search results - page 52 / 174
» Bidirectionalizing graph transformations
Sort
View
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...
ASP
2003
Springer
15 years 3 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
14 years 8 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
DATESO
2004
134views Database» more  DATESO 2004»
14 years 11 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
ICWE
2007
Springer
15 years 3 months ago
Model Transformation for Service-Oriented Web Applications Development
In recent years, innovation in technologies such as web services, business process automation, etc., have motivated a new paradigm in the application development field to appear, k...
Valeria de Castro, Juan M. Vara, Esperanza Marcos