๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel algorithm for generating combinations

โœ Scribed by C.-J. Lin

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
576 KB
Volume
17
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A fast algorithm for parallel model comb
A fast algorithm for parallel model combination for noisy speech recognition
โœ Tai-Hwei Hwang; Hsiao-Chuan Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

Based on the log-normal assumption, parallel model combination (PMC) provides an effective method to adapt the cepstral means and variances of speech models for noisy speech recognition. In addition, the log-add method has been derived to adapt the mean by ignoring the cepstral variance during the p

An optimal parallel algorithm for genera
An optimal parallel algorithm for generating permutations in minimal change order
โœ Jong-Chuang Tsay; Wei-Ping Lee ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 430 KB

Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processo

Approximation algorithms for general par
Approximation algorithms for general parallel task scheduling
โœ Oh-Heum Kwon; Kyung-Yong Chwa ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 281 KB

A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for bot