Sciweavers

866 search results - page 37 / 174
» Bidirectionalizing graph transformations
Sort
View
GTTSE
2007
Springer
15 years 3 months ago
Automated Merging of Feature Models Using Graph Transformations
Abstract. Feature Models (FMs) are a key artifact for variability and commonality management in Software Product Lines (SPLs). In this context, the merging of FMs is being recogniz...
Sergio Segura, David Benavides, Antonio Ruiz Cort&...
ICASSP
2010
IEEE
14 years 10 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...
ASAP
2010
IEEE
143views Hardware» more  ASAP 2010»
14 years 11 months ago
Loop transformations for interface-based hierarchies IN SDF graphs
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
Jonathan Piat, Shuvra S. Bhattacharyya, Mickaë...
MODELS
2007
Springer
15 years 3 months ago
Scenario Integration via the Transformation and Manipulation of Higher-order Graphs
The integration of different models, such as scenarios, is an important component of the requirements engineer’s work. If manually performed, the integration operation is error-...
Hongzhi Liang
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
15 years 2 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...