We present two new algorithms for searching in sorted X ุ Y ุ R ุ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n โซุโฌ O(2 s/4 ), we obtain a
Scalable Parallel Algorithms for FPT Problems
โ Scribed by Faisal N. Abu-Khzam; Michael A. Langston; Pushkar Shanbhag; Christopher T. Symons
- Book ID
- 106148698
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 255 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper considers a variety of geometric pattern recognition problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with 0(nรp) local memory each (i.e., 0(nรp) memory cells of 3(log n) bits apiece), where the processors are connected to an arbitrary
Finite element meshes and node-numberings suitable for parallel solution with equally loaded processors are presented for linear orthotropic elliptic partial differential equations. These problems are of great importance, for instance in the oil and airfoil industries. The linear systems of equation