Parallel Algorithms for Machine Intelligence and Vision
Vipin Kumar, P. S. Gopalakrishnan, Laveen N. Kanal
Springer-Verlag, 1990 - Computers - 433 pages
Recent research results in the area of parallel algorithms for problem solving, search, natural language parsing, and computer vision, are brought together in this book. The research reported demonstrates that substantial parallelism can be exploited in various machine intelligence and vision problems. The chapter authors are prominent researchers actively involved in the study of parallel algorithms for machine intelligence and vision. Extensive experimental studies are presented that will help the reader in assessing the usefulness of an approach to a specific problem. Intended for students and researchers actively involved in parallel algorithms design and in machine intelligence and vision, this book will serve as a valuable reference work as well as an introduction to several research directions in these areas.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Vipin Kumar and V Nageshwara
Distributed Game Tree Search
Multiprocessing of Combinatorial Search Problems
9 other sections not shown
allocation alpha-beta AND-parallelism architecture Artificial Intelligence atom best-first best-first search branching factor clause communication overhead concurrent connected corresponding cutoff depth-first search dimensional convolution disparity distributed edge efficient evaluation Figure game tree goal tree graph h h h heuristic Hough transform hypercube IEEE implementation initial input Intel interconnection isoefficiency function iteration Kumar labeled large number Logic Programming lower bound machine mapping mesh message passing method MIMD multiprocessor node ordering number of processors obtained OR-parallel outin tree output parallel algorithm parallel computer parallel DFS parallel execution Parallel Processing parallel window search parameters parse parse tree path performance pixels PRISM problem solving Proc Prolog pruning query readback REDUCE scheduling search overhead search space segment sequential serial shared memory SIMD simulation spatiotemporal image speedup stack structure subproblems subtree systolic array tasks tion tree search tuple unification update values variables vision work-distribution scheme