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

An efficient parallel algorithm for computing a large independent set in a planar graph

โœ Scribed by Marek Chrobak; Joseph Naor

Publisher
Springer
Year
1991
Tongue
English
Weight
750 KB
Volume
6
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An optimal parallel perceptron learning
An optimal parallel perceptron learning algorithm for a large training set
โœ Tzung-Pei Hong; Shian-Shyong Tseng ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

In [2], a parallel perceptron learning algorithm on the single-channel broadcast communication model was proposed to speed up the learning of weights of perceptrons [3]. The results in [2] showed that given n training examples, the average speedup is 1.48\*n~ n by n processors. Here, we explain how