Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

WALCOM
2008
IEEE

favoriteEmaildiscussreport

95views Algorithms» more WALCOM 2008»

Indexing Circular Patterns

14 years 9 days ago

Indexing Circular Patterns

Download www.dcs.kcl.ac.uk

This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern P = P1 . . . Pm. The circular pattern C(P) is formed by concatenating P1 to the right of Pm. We can view C(P) as a set of

Costas S. Iliopoulos, M. Sohel Rahman

Real-time Traffic

Algorithms | Circular Pattern | Pattern Matching | Pattern Matching Problem | WALCOM 2008 |

claim paper

Related Content

» The Circular Chromatic Index of Flower Snarks

» The circular chromatic index of graphs of high girth

» Tracking Multiple Circular Objects in Video Using Helmholtz Principle

» Circular chromatic index of Cartesian products of graphs

» Concentric Circular Array Antenna Null Steering Synthesis by Using Modified Hybrid Ant Col...

» Indexing and mining topological patterns for drug discovery

» Obtaining High Fault Coverage with Circular BIST Via State Skipping

» Optical MEMS pressure sensor using ring resonator on a circular diaphragm

» Circular contextbased semantic matching to identify web service composition

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	WALCOM
Authors	Costas S. Iliopoulos, M. Sohel Rahman

Comments (0)