Pages that link to "Item:Q3817609"
From MaRDI portal
The following pages link to On the communication complexity of generalized 2-D convolution on array processors (Q3817609):
Displayed 3 items.
- Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory (Q1178193) (← links)
- Derivation and Analysis of Fast Bilinear Algorithms for Convolution (Q5140608) (← links)
- SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES (Q5696893) (← links)