Paper Info
Title
Parallel Bi-dimensional Pattern Matching with Scaling
Abstract
This paper deals with the problem of bi-dimensional pat- tern matching with scaling. The problem is to find all oc- currences of the pattern in the text, scaled to all natural multiples. We have proposed an efficient par- allel algorithm for this problem on CREW-PRAM with processors. It takes time.
Year
Venue
Keywords
2002
IASTED PDCS
crew pram,bi-dimensional pattern matching,parallel algorithms,scaling,pattern matching,parallel algorithm
Field
DocType
Citations 
Computer science,Algorithm,Scaling,Pattern matching
Conference
0
PageRank 
References 
Authors
0.34
7
3
Name
Order
Citations
PageRank
Marghoob Mohiyuddin117911.27
Vidit Jain21238.26
Phalguni Gupta380582.58