The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
An image algorithm for computing the Hausdorff distance efficiently in linear time
Information Processing Letters
A bridging model for parallel computation
Communications of the ACM
Computing the minimum Hausdorff distance for point sets under translation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Approximate matching of polygonal shapes (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing the minimum Hausdorff distance between two point sets on a line under translation
Information Processing Letters
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Polygonal approximation by boundary reduction
Pattern Recognition Letters
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
On a metric distance between fuzzy sets
Pattern Recognition Letters
Parallel algorithms for regular architectures: meshes and pyramids
Parallel algorithms for regular architectures: meshes and pyramids
On Hausdorff-like metrics for fuzzy sets (poster session)
Pattern Recognition Letters
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Scaleable parallel algorithms for lower envelopes with applications
Journal of Parallel and Distributed Computing
Scalable parallel algorithms for geometric pattern recognition
Journal of Parallel and Distributed Computing
A fast string searching algorithm
Communications of the ACM
Efficient computation of the Euclidean distance transform
Computer Vision and Image Understanding
Algorithms sequential & parallel: a unified approach
Algorithms sequential & parallel: a unified approach
Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
| Hi-index | 0.00 |
We introduce asymptotically optimal algorithms for gathering and scattering a small-to-moderate sized set of data on a coarse grained parallel computer. We use these operations to obtain efficient to optimal solutions to several fundamental problems in image processing and string matching (exact or approximate) for coarse grained parallel computers.