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

Parallel enclosing rectangle on SIMD machines

โœ Scribed by Chang-Sung Jeong; Jung-Ju Choi; Der-Tsai Lee

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
724 KB
Volume
18
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Enclosing k points in the smallest axis
Enclosing k points in the smallest axis parallel rectangle
โœ Michael Segal; Klara Kedem ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 445 KB

We consider the following clustering problem. Given a set S of II points in the plane, and given an integer k, n/2 < k < n, we want to find the smallest axis parallel rectangle (smallest perimeter or area) that encloses exactly k points of S. We present an algorithm which runs in time 0( n + k( n -k

Extended Kalman Filter Training of Neura
Extended Kalman Filter Training of Neural Networks on a SIMD Parallel Machine
โœ Shuhui Li; Donald C. Wunsch; Edgar O'Hair; Michael G. Giesselmann ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 260 KB

The extended Kalman filter (EKF) algorithm has been shown to be advantageous for neural network trainings. However, unlike the backpropagation (BP), many matrix operations are needed for the EKF algorithm and therefore greatly increase the computational complexity. This paper presents a method to do

Fast parallel simulated annealing for tr
Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections
โœ Chang-Sung Jeong; Myung-Ho Kim ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 459 KB

Jeong, C.S. and M.H. Kim, Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections, Parallel Computing 17 (1991) 221-228 In this paper, we present a fast parallel simulated annealing algorithm for solving traveling salesman problem(TSP) on SIMD m