1550 search results - page 57 / 310 » Benchmarking for Graph Transformation |
DAC
1997
ACM
14 years 2 months ago
1997
ACM
We propose a methodology for applying gate-level logic transformations to optimize power in digital circuits. Statistically simulated[14] switching information, gate delays, signa...
ICIP
2010
IEEE
13 years 9 months ago
2010
IEEE
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
ICIP
2001
IEEE
15 years 22 days ago
2001
IEEE
This work considers the efficient coding of hyperspectral images. The shape-adaptive DCT is extended to the three-dimensional case. Both the 3D-SA-DCT and the conventional 3D-DCT ...
GD
2005
Springer
14 years 4 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
RELMICS
2009
Springer
14 years 5 months ago
2009
Springer
We define collagories essentially as “distributive allegories without zero morphisms”, and show that they are sufficient for accommodating the relation-algebraic approach to ...