In computer science, the Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- K. Suresh Joseph
- 2017

Named Data Networking (NDN) is the hot research topics for future Internet. It is the contrast model of traditional IP… (More)

Is this relevant?

2016

2016

- Sercan Aygün, Ece Olcay Güneş, Lida Kouhalvandi
- 2016 IEEE 4th Workshop on Advances in Information…
- 2016

Parallel computations in multicore architectures are in big interest these days. Nearly all newly manufactured computers have… (More)

Is this relevant?

2016

2016

- Cesar Byron Guevara Maldonado, Matilde Santos Penas, María Victoria López López
- IEEE Latin America Transactions
- 2016

In this paper an algorithm for detecting anomalous behavior on computer systems is proposed. The work is based on information… (More)

Is this relevant?

2014

2014

- Manju Alex
- 2014

Rule acquisition is also an important issue, and the Web that implies inferential rules can be a major source of rule acquisition… (More)

Is this relevant?

2013

2013

- François Pottier
- 2013

In my view, the Knuth-Morris-Pratt string searching algorithm is one of those “magic” algorithms that do something wonderful but… (More)

Is this relevant?

2010

2010

- Pawel Gawrychowski, Artur Jez, Lukasz Jez
- Theory of Computing Systems
- 2010

Let $\pi'_{w}$ denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following… (More)

Is this relevant?

2010

2010

- Esko Ukkonen
- J. UCS
- 2010

Given finite sets P and T of points in the Euclidean space R, the point pattern matching problem studied in this paper is to find… (More)

Is this relevant?

2007

2007

Knuth-Morris-Pratt (KMP) arrays are known as the ”failure function” of the Knuth-Morris-Pratt string matching algorithm. We… (More)

Is this relevant?

2004

2004

- Ajay H. Daptardar, Dana Shapira
- Data Compression Conference, 2004. Proceedings…
- 2004

This paper presents a compressed pattern matching in Huffman encoded texts. A modified Knuth-Morris-Pratt (KMP) algorithm is used… (More)

Is this relevant?

1981

1981

- Gerhard Barth
- Inf. Process. Lett.
- 1981

pattern and text of lengths m and n, respectively, are given and it has to be tested whether the pattern occurs as a contiguous… (More)

Is this relevant?