Sciweavers

1722 search results - page 67 / 345
» Variables in Concept Graphs
Sort
View
SEMWEB
2005
Springer
15 years 3 months ago
RUL: A Declarative Update Language for RDF
We propose a declarative update language for RDF graphs which is based on the paradigms of query and view languages RQL and RVL. Our language, called RUL, ensures that the executio...
M. Magiridou, S. Sahtouris, Vassilis Christophides...
FLAIRS
2004
14 years 11 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
Ying Feng, Robert L. Goldstone, Vladimir Menkov
ITSSA
2006
91views more  ITSSA 2006»
14 years 9 months ago
Organization Detection Using Emergent Computing
: Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organizat...
Cyrille Bertelle, Antoine Dutot, Fréd&eacut...
JGT
2006
98views more  JGT 2006»
14 years 9 months ago
Group chromatic number of planar graphs of girth at least 4
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Hong-Jian Lai, Xiangwen Li
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
15 years 3 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...