Sciweavers

866 search results - page 76 / 174
» Bidirectionalizing graph transformations
Sort
View
IBIS
2006
109views more  IBIS 2006»
14 years 9 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
JOT
2006
113views more  JOT 2006»
14 years 9 months ago
Constraint Validation in Model Compilers
Model transformation has become one of the most focused research field, motivated by for instance the OMG's Model-Driven Architecture (MDA). Metamodeling is a central techniq...
László Lengyel, Tihamer Levendovszky...
ASYNC
2004
IEEE
121views Hardware» more  ASYNC 2004»
15 years 1 months ago
Static Tokens: Using Dataflow to Automate Concurrent Pipeline Synthesis
We describe a new intermediate compiler representation, static token form, that is suitable for dataflow-style synthesis of high-level asynchronous specifications. Static token fo...
John Teifel, Rajit Manohar
ICPR
2004
IEEE
15 years 11 months ago
Graph Based Image Matching
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
Chong-Wah Ngo, Hui Jiang
ICCS
2005
Springer
15 years 3 months ago
Variables in Concept Graphs
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...
Frithjof Dau