Sciweavers

79 search results - page 14 / 16
» Graph Rewriting in Computational Origami
Sort
View
EDBT
2010
ACM
246views Database» more  EDBT 2010»
14 years 1 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
ENTCS
2008
102views more  ENTCS 2008»
13 years 6 months ago
Encoding Distributed Process Calculi into LMNtal
Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting tha...
Kazunori Ueda
ICALP
2007
Springer
14 years 14 days ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 8 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite
GG
2008
Springer
13 years 7 months ago
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
Guilherme Rangel, Leen Lambers, Barbara König...