Fractal objects like Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of s...
Aditya Kapoor, Kush Arora, Ajai Jain, G. P. Kapoor
Abstract. The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of...
Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design ...
We develop a memory-efficient off-line algorithm for the enumeration of global states of a distributed computation. The algorithm allows the parameterization of its memory requir...
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...