The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Vector models for data-parallel computing
Vector models for data-parallel computing
Reconfigurable massively parallel computers
Reconfigurable massively parallel computers
Fortran 90 explained
Parallel Computations on Reconfigurable Meshes
IEEE Transactions on Computers
A VLSI layout for a pipelined Dadda multiplier
ACM Transactions on Computer Systems (TOCS)
Content Addressable Parallel Processors
Content Addressable Parallel Processors
Introduction to the Design and Analysis of Algorithms
Introduction to the Design and Analysis of Algorithms
Constant Time Sorting on Reconfigurable Meshes
IEEE Transactions on Computers
Implementation and evaluation of a parallel architecture using asynchronous communications
CAMP '95 Proceedings of the Computer Architectures for Machine Perception
A parallel fuzzy scale-space approach to the unsupervised texture separation
Pattern Recognition Letters
Extending the data parallel paradigm with data-dependent operators
Parallel Computing - Parallel computing in image and video processing
Adaptive Segmentation of MR Axial Brain Images Using Connected Components
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
On Parallel Reconfigurable Architectures for Image Processing
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Parallel Asynchronous Watershed Algorithm-Architecture
IEEE Transactions on Parallel and Distributed Systems
A new motion detection algorithm based on Σ-Δ background estimation
Pattern Recognition Letters
Parallel processing for image and video processing: Issues and challenges
Parallel Computing
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 14.98 |
This paper presents a new parallel computing model called Associative Nets. This model relies on basic primitives called associations that consist to apply an associative operator over connected components of a subgraph of the physical interprocessor connection graph. Associations can be very efficiently implemented (in terms of hardware cost or processing time) thanks to asynchronous computation. This model is quite effective for image analysis and several other fields; as an example, graph processing algorithms are presented. While relying on a much simpler architecture, these algorithms have, in general, a complexity equivalent to the one obtained by more expensive computing models, like the PRAM model.