Pages that link to "Item:Q3774926"
From MaRDI portal
The following pages link to Data Movement Techniques for the Pyramid Computer (Q3774926):
Displaying 13 items.
- The \(3^{*}\)-connected property of pyramid networks (Q623179) (← links)
- A bypassing path based routing algorithm for the pyramid structures (Q856156) (← links)
- The triangular pyramid: Routing and topological properties (Q985070) (← links)
- Two-node-Hamiltonicity of enhanced pyramid networks (Q985080) (← links)
- Properties of a hierarchical network based on the star graph (Q985088) (← links)
- Computing convexity properties of images on a pyramid computer (Q1175644) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays (Q1176071) (← links)
- Algorithmic construction of Hamiltonians in pyramids (Q1603354) (← links)
- HETEROGENEOUS ALGORITHMS FOR IMAGE UNDERSTANDING ARCHITECTURE∗ (Q4819973) (← links)
- Parallel computation of discrete Voronoi diagrams (Q5096154) (← links)
- Distance-edge-monitoring sets of networks (Q6541036) (← links)
