SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES (Q5696893): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the communication complexity of generalized 2-D convolution on array processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Time Algorithm for Template Matching on a Reconfigurable Array of Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗ / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTEGER SORTING AND ROUTING IN ARRAYS WITH RECONFIGURABLE OPTICAL BUSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Processing Approaches to Image Correlation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for computer vision problems / rank
 
Normal rank

Revision as of 17:46, 10 June 2024

scientific article; zbMATH DE number 2216270
Language Label Description Also known as
English
SCALABLE AND OPTIMAL SPEED-UP PARALLEL ALGORITHMS FOR TEMPLATE MATCHING ON ARRAYS WITH RECONFIGURABLE OPTICAL BUSES
scientific article; zbMATH DE number 2216270

    Statements