scholarly journals Partitionable Bus-based String-matching Algorithm for Run-length Coded Strings With VLDCs

VLSI Design ◽  
1999 ◽  
Vol 9 (1) ◽  
pp. 55-67
Author(s):  
Hsiu-Niang Chen ◽  
Kuo-Liang Chung
Keyword(s):  
Parallel Algorithm ◽  
String Matching ◽  
Vlsi Implementation ◽  
Finite Alphabet ◽  
Matching Algorithm ◽  
Run Length ◽  
Special Symbol ◽  
Reconfigurable Mesh

String matching (SM) problem is to find the occurrences of a pattern within a text. A vanable length don't care (VLDC) is a special symbol, not belonging to a finite alphabet ∑ but in ∑*. Each VLDC in the pattern can match any substring in the text. Given a run-length coded text of length 2n over ∑ and a run-length coded pattern of length 2m over ∑*, this paper first presents an O(1) time parallel SM algorithm for run-length coded strings with VLDCs on a reconfigurable mesh (RM) using O(nm) processors. Consider the hardware limitation in VLSI implementation. In order to be suitable for VLSI modular implementation, a partitionable parallel algorithm on the RM with limited processors is further presented. For N < n and M < m, the SM for run-length coded strings with VLDCs can be solved in O(X^Y^) time on the RM using O(NM)(= O((nm)/((X^Y^))) processors, where X^ = [(n – 1)/(N – 1)] and Y^ = [(m – 1)/(M – 1)].

scholarly journals An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String

1995 ◽  
Vol 2 (11) ◽  
Author(s):  
Alberto Apostolico ◽  
Dany Breslauer
Keyword(s):  
Lower Bound ◽  
Parallel Algorithm ◽  
Optimal Algorithm ◽  
String Matching ◽  
Input String ◽  
Matching Algorithm

An optimal O(log log n) time concurrent-read concurrent-write parallel<br />algorithm for detecting all squares in a string is presented. A tight<br />lower bound shows that over general alphabets this is the fastest possible<br />optimal algorithm. When p processors are available the bounds become<br />Theta(n log n / p + log log 2p). The algorithm uses an optimal parallel<br />string-matching algorithm together with periodicity properties to locate<br />the squares within the input string.

scholarly journals Contribution to Semantic Analysis of Arabic Language

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Anis Zouaghi ◽  
Mounir Zrigui ◽  
Georges Antoniadis ◽  
Laroussi Merhbene
Keyword(s):  
Information Retrieval ◽  
Semantic Analysis ◽  
String Matching ◽  
Ambiguous Word ◽  
Arabic Language ◽  
New Approach ◽  
Matching Algorithm ◽  
Ambiguous Words ◽  
Lesk Algorithm ◽  
Context Of Use

We propose a new approach for determining the adequate sense of Arabic words. For that, we propose an algorithm based on information retrieval measures to identify the context of use that is the closest to the sentence containing the word to be disambiguated. The contexts of use represent a set of sentences that indicates a particular sense of the ambiguous word. These contexts are generated using the words that define the senses of the ambiguous words, the exact string-matching algorithm, and the corpus. We use the measures employed in the domain of information retrieval, Harman, Croft, and Okapi combined to the Lesk algorithm, to assign the correct sense of those proposed.

A FAST PATTERN-MATCHING ALGORITHM ON MODULAR MESH-CONNECTED COMPUTERS WITH MULTIPLE BUSES

1995 ◽  
Vol 09 (02) ◽  
pp. 411-419
Author(s):  
KUO-LIANG CHUNG
Keyword(s):  
Parallel Algorithm ◽  
Pattern Matching ◽  
Matching Algorithm ◽  
Pattern Matching Algorithm ◽  
Multiple Buses

Given a pattern of length m and a text of length n, commonly m≪n, this paper presents a randomized parallel algorithm for pattern matching in O(n1/10) (=O(n1/10+(n−m)1/10)) time on a newly proposed n3/5×n2/5 modular meshconnected computers with multiple buses. Furthermore, the time bound of our parallel algorithm can be reduced to O(n1/11) if fewer processors are used.

Sign in / Sign up

Export Citation Format

Share Document