Login / Signup
A graph covering algorithm for a coarse grain reconfigurable system.
Yuanqing Guo
Gerard J. M. Smit
Hajo Broersma
Paul M. Heysters
Published in:
LCTES (2003)
Keyphrases
</>
coarse grain
computational complexity
fine grain
image processing
optimal solution
dynamic programming
hardware implementation
np hard
graphical models
computer systems
highly efficient
minimum spanning tree
parallel computation