𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Parallel Space-Time Algorithm

✍ Scribed by Christlieb, Andrew J.; Haynes, Ronald D.; Ong, Benjamin W.

Book ID
118188071
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
257 KB
Volume
34
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Genetic-Algorithm Approach to Scheduli
A Genetic-Algorithm Approach to Scheduling Communications for Embedded Parallel Space–Time Adaptive Processing Algorithms
✍ Jack M. West; John K. Antonio πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 298 KB

Computational efficiency is of great significance for high-performance embedded applications. The work here develops and evaluates a geneticalgorithm-based (GA-based) optimization technique for the scheduling of messages for a class of parallel embedded signal processing techniques known as space-ti

Ultrafast Expected Time Parallel Algorit
Ultrafast Expected Time Parallel Algorithms
✍ Philip D MacKenzie; Quentin F Stout πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 227 KB

It was shown previously that sorting n items into n locations with a polynomial Ε½ . number of processors requires ⍀ log nrlog log n time. We sidestep this lower Ε½ . bound with the idea of padded sorting, or sorting n items into n q o n locations. Because many problems do not rely on the exact rank o

A space-efficient Huffman decoding algor
A space-efficient Huffman decoding algorithm and its parallelism
✍ Yih-Kai Lin; Kuo-Liang Chung πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 178 KB

This paper ΓΏrst transforms the Hu man tree into a single-side growing Hu man tree, then presents a memory-e cient data structure to represent the single-side growing Hu man tree, which requires (n + d) log 2 n -bits memory space, where n is the number of source symbols and d is the depth of the Hu m