article

Spacetime representations of computational structures

Authors:

W L. Miranker,

A WinklerAuthors Info & Claims

Computing, Volume 32, Issue 2

Pages 93 - 114

https://doi.org/10.1007/BF02253685

Published: 11 May 1984 Publication History

Abstract

No abstract available.

Cited By

View all

Jia LLuo ZLu LLiang Y(2022)Automatic Generation of Spatial Accelerator for Tensor AlgebraIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.320994942:6(1898-1911)Online publication date: 27-Sep-2022
https://dl.acm.org/doi/10.1109/TCAD.2022.3209949
Burrows EHaveraaen MAcar UCosta V(2012)Programmable data dependencies and placementsProceedings of the 7th workshop on Declarative aspects and applications of multicore programming10.1145/2103736.2103741(31-40)Online publication date: 28-Jan-2012
https://dl.acm.org/doi/10.1145/2103736.2103741
Milovanović EBekakos MMilovanović I(2009)Synthesis of space optimal systolic arrays for band matrix-vector multiplicationThe Journal of Supercomputing10.1007/s11227-008-0241-x49:3(269-290)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1007/s11227-008-0241-x
Show More Cited By

Index Terms

Spacetime representations of computational structures

Recommendations

Computational morphogenesis of free‐form grid structures with Voronoi diagram
Abstract
Free‐form grid structures have developed increasingly with the development of computer‐aided design and advanced construction technology. However, the grid generation is still a difficulty for designing free‐form grid structures. The computational ...
Computational complexity of automatic structures
Dynamic hair capture using spacetime optimization

Dynamic hair strands have complex structures and experience intricate collisions and occlusion, posing significant challenges for high-quality reconstruction of their motions. We present a comprehensive dynamic hair capture system for reconstructing ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Computing Volume 32, Issue 2

1984

89 pages

ISSN:0010-485X

Editor:
Rudolf Albrecht
Univ. Innsbruck, Innsbruck, Austria

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 11 May 1984

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jia LLuo ZLu LLiang Y(2022)Automatic Generation of Spatial Accelerator for Tensor AlgebraIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.320994942:6(1898-1911)Online publication date: 27-Sep-2022
https://dl.acm.org/doi/10.1109/TCAD.2022.3209949
Burrows EHaveraaen MAcar UCosta V(2012)Programmable data dependencies and placementsProceedings of the 7th workshop on Declarative aspects and applications of multicore programming10.1145/2103736.2103741(31-40)Online publication date: 28-Jan-2012
https://dl.acm.org/doi/10.1145/2103736.2103741
Milovanović EBekakos MMilovanović I(2009)Synthesis of space optimal systolic arrays for band matrix-vector multiplicationThe Journal of Supercomputing10.1007/s11227-008-0241-x49:3(269-290)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1007/s11227-008-0241-x
Efremides OBekakos M(2001)Designing processor-time optimal systolic configurationsHighly parallel computaions10.5555/771571.771583(339-364)Online publication date: 1-Dec-2001
https://dl.acm.org/doi/10.5555/771571.771583
Bekakos MMilovanović IMilovanović ETokić TStojčev M(2001)Hexagonal systolic arrays for matrix multiplicationHighly parallel computaions10.5555/771571.771579(175-209)Online publication date: 1-Dec-2001
https://dl.acm.org/doi/10.5555/771571.771579
Prakash SParker A(2001)SOSReadings in hardware/software co-design10.5555/567003.567031(324-337)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.5555/567003.567031
Elfimova LKapitonova Y(2001)A Fast Algorithm for Matrix Multiplication and Its Efficient Realization on Systolic ArraysCybernetics and Systems Analysis10.1023/A:101667631898837:1(109-121)Online publication date: 1-Jan-2001
https://dl.acm.org/doi/10.1023/A%3A1016676318988
Alexander WReeves DGloster C(2000)Parallel image processing with the block data parallel architectureIBM Journal of Research and Development10.1147/rd.445.068144:5(681-702)Online publication date: 1-Sep-2000
https://dl.acm.org/doi/10.1147/rd.445.0681
Zimmermann KAchtziger W(1998)On Time Optimal Implementation of Uniform Recurrences onto Array Processors via Quadratic ProgrammingJournal of VLSI Signal Processing Systems10.1023/A:100800823130419:1(19-38)Online publication date: 1-May-1998
https://dl.acm.org/doi/10.1023/A%3A1008008231304
Zimmermann K(1997)A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGPJournal of VLSI Signal Processing Systems10.5555/276797.281295617:1(21-41)Online publication date: 1-Sep-1997
https://dl.acm.org/doi/10.5555/276797.2812956
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Computational morphogenesis of free‐form grid structures with Voronoi diagram

Computational complexity of automatic structures

Dynamic hair capture using spacetime optimization

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations