Sciweavers

1153 search results - page 95 / 231
» Reversing graph transformations
Sort
View
ICSM
2002
IEEE
15 years 8 months ago
A Software Transformation Framework for Quality-Driven Object-Oriented Re-engineering
In re-engineering object-oriented legacy code, it is frequently useful to introduce a design pattern in order to improve specific non-functional requirements (e.g., maintainabili...
Ladan Tahvildari, Kostas Kontogiannis
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
15 years 7 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt
PVLDB
2010
145views more  PVLDB 2010»
15 years 1 months ago
Using XMorph to Transform XML Data
XMorph is a new, shape polymorphic, domain-specific XML query language. A query in a shape polymorphic language adapts to the shape of the input, freeing the user from having to k...
Curtis E. Dyreson, Sourav S. Bhowmick, Kirankanth ...
RECOMB
2007
Springer
16 years 3 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
CSMR
2005
IEEE
15 years 8 months ago
Database Wrappers Development: Towards Automatic Generation
Wrapping databases allows them to be reused in formerly unplanned contexts, such as web-based applications or federated systems. Indeed, a wrapper can provide external clients of ...
Philippe Thiran, Jean-Luc Hainaut, Geert-Jan Hoube...