Add to ORKGThis paper deals with the problem of bi-dimensional pattern matching with scaling. The problem is to find all occurrences of the m m pattern in the N N text, scaled to all natural multiples. We have proposed an efficient parallel algorithm for this problem on CREW-PRAM with p processors. It takes O( 2 ) time
Abstract—The need for processing power is constantly increas-ing as more processing-demanding and ti...
AbstractWe describe the first worst-case efficient algorithm for simultaneously matching multiple re...
International audienceThe multi-pattern matching problem consists in finding all occurrences of the ...
Given a text of length n and a pattern of length m, we present a parallel linear algorithm for findi...
We give an alphabet-independent deterministic parallel algorithm for finding all occurrences of a pa...
In this paper, we present a simple algorithm for solving the multipattern matching problem, with opt...
AbstractSimplified versions of Kedem–Landau–Palem algorithms for parallel one-dimensional and two-di...
Abstract. A very fast parallel approach to pattern matching is presented. The ap-proach is based on ...
AbstractWe give an alphabet-independent optimal parallel algorithm for the searching phase of three-...
The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variet...
AbstractWe present a parallel algorithm for two dimensional text searching over a general alphabet. ...
Let WRAM [PRAM]be a parallel computer with p processors (RAMs) which share a common memory and are a...
Abstract. The performance of the pattern matching algorithms based on bit-parallelism degrades when ...
The pattern matching is the problem of locating one string, a pattern, inside another, a text, which...
Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrenc...
Abstract—The need for processing power is constantly increas-ing as more processing-demanding and ti...
AbstractWe describe the first worst-case efficient algorithm for simultaneously matching multiple re...
International audienceThe multi-pattern matching problem consists in finding all occurrences of the ...
Given a text of length n and a pattern of length m, we present a parallel linear algorithm for findi...
We give an alphabet-independent deterministic parallel algorithm for finding all occurrences of a pa...
In this paper, we present a simple algorithm for solving the multipattern matching problem, with opt...
AbstractSimplified versions of Kedem–Landau–Palem algorithms for parallel one-dimensional and two-di...
Abstract. A very fast parallel approach to pattern matching is presented. The ap-proach is based on ...
AbstractWe give an alphabet-independent optimal parallel algorithm for the searching phase of three-...
The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variet...
AbstractWe present a parallel algorithm for two dimensional text searching over a general alphabet. ...
Let WRAM [PRAM]be a parallel computer with p processors (RAMs) which share a common memory and are a...
Abstract. The performance of the pattern matching algorithms based on bit-parallelism degrades when ...
The pattern matching is the problem of locating one string, a pattern, inside another, a text, which...
Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrenc...
Abstract—The need for processing power is constantly increas-ing as more processing-demanding and ti...
AbstractWe describe the first worst-case efficient algorithm for simultaneously matching multiple re...
International audienceThe multi-pattern matching problem consists in finding all occurrences of the ...