Sciweavers

688 search results - page 74 / 138
» Comparison of Conceptual Graphs
Sort
View
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
15 years 1 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
ISIM
2007
14 years 11 months ago
Formal Computation Independent Model of the Problem Domain within the MDA
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
Janis Osis, Erika Asnina, Andrejs Grave
AAAI
2004
14 years 11 months ago
Comparing Cognitive and Computational Models of Narrative Structure
A growing number of applications seek to incorporate automatically generated narrative structure into interactive virtual environments. In this paper, we evaluate a representation...
David B. Christian, R. Michael Young
WICSA
2004
14 years 11 months ago
Style-Based Refinement of Dynamic Software Architectures
In this paper, we address the correct refinement of abstract architectural models into more platformspecific representations. We consider the challenging case of dynamic architect...
Luciano Baresi, Reiko Heckel, Sebastian Thöne...
ACL
1998
14 years 11 months ago
Terminological Variation, a Means of Identifying Research Topics from Texts
After extracting terms from a corpus of titles and s in English, syntactic variation relations are identified amongst them in order to detect research topics. Three types of synta...
Fidelia Ibekwe-Sanjuan