Sciweavers

4074 search results - page 58 / 815
» Abstract Graph Transformation
Sort
View
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...
CASES
2010
ACM
14 years 8 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
ENTCS
2008
153views more  ENTCS 2008»
14 years 9 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
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 4 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