1550 search results - page 57 / 310 » Benchmarking for Graph Transformation |
124
Voted
DAC
1997
ACM
15 years 4 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
14 years 10 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...
109
click to vote
ICIP
2001
IEEE
16 years 2 months 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 ...
102
Voted
GD
2005
Springer
15 years 6 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....
93
Voted
RELMICS
2009
Springer
15 years 7 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 ...