𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient parallel processing of competitive learning algorithms

✍ Scribed by Kentaro Sano; Shintaro Momose; Hiroyuki Takizawa; Hiroaki Kobayashi; Tadao Nakamura

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
563 KB
Volume
30
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient pre-processing in the parallel
Efficient pre-processing in the parallel block-Jacobi SVD algorithm
✍ Gabriel OkΕ‘a; MariΓ‘n VajterΕ‘ic πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 272 KB

One way, how to speed up the computation of the singular value decomposition of a given matrix A 2 C mΓ‚n ; m P n, by the parallel two-sided block-Jacobi method, consists of applying some pre-processing steps that would concentrate the Frobenius norm near the diagonal. Such a concentration should hop

Variation in efficiency of parallel algo
Variation in efficiency of parallel algorithms
✍ Akiko Hayashi; Robert J. Melosh; Senol Utku; Moktar Salama πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 867 KB
Efficient Parallel Algorithms for Graphs
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
✍ Jens Lagergren πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem Ε½ 3 . Ε½. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-Ε½ 2 . position algorithm is O O n log n . The tree-decomposi