1153 search results - page 97 / 231 » Reversing graph transformations |
97
Voted
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
By imposing a single hierarchy on data, XML makes queries brittle in the sense that a query might fail to produce the desired result if it is executed on the same data organized in...
80
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
118
Voted
ECBS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we argue for UML-based metamodeling and pattern-based graph transformation techniques in computer-based systems development through an illustrative example from the ...
84
Voted
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
76
Voted
DELTA
2004
IEEE
15 years 4 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...