In computer science, the Zhu–Takaoka string matching algorithm is a variant of the Boyer–Moore string search algorithm. It uses two consecutive text… (More)

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

2014

2014

- Hakem Adil Kadhim, NurAini AbdulRashidx
- 2014 International Conference on Computer and…
- 2014

The string matching algorithms have broad applications in many areas of computer sciences. These areas include operating systems… (More)

Is this relevant?

2012

2012

Human dentin autograft was reported in 2003 as a first clinical case (Murata et al., 2003), while human bone autograft was done… (More)

Is this relevant?

2011

2011

A 5 mm thick periodically poled bulk Rb-doped KTiOPO4 (KTP) crystal with a period of 38.86 μm was fabricated by electric field… (More)

Is this relevant?

2008

2008

- Yijie Han
- Inf. Process. Lett.
- 2008

We improve the all pairs shortest path algorithm given by Takaoka to time complexity O(n3/ log n). Our improvement is achieved by… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Timothy M. Chan
- Algorithmica
- 2005

We describe an O(n 3/log n)-time algorithm for the all-pairs-shortest-paths problem for a real-weighted directed graph with n… (More)

Is this relevant?

2005

2005

- Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
- ISAAC
- 2005

Given a sequence of n real numbers and an integer k, 1 k 1 2n(n − 1), the k maximum-sum segments problem is to locate the k… (More)

Is this relevant?

2005

2005

Using the theory of almost conserved energies and the “I-method” developed by Colliander, Keel, Staffilani, Takaoka and Tao, we… (More)

Is this relevant?

2004

2004

- Keiko Shimamoto, Ryuichi Sakai, +4 authors Yasushi Shigeri
- 2004

Nontransportable blockers of the glutamate transporters are important tools for investigating mechanisms of synaptic transmission… (More)

Is this relevant?

2002

2002

- Thomas Berry, Somasundaram Ravindran
- Kybernetika
- 2002

In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run… (More)

Is this relevant?

2001

2001

- Shane Saunders, Tadao Takaoka
- Electr. Notes Theor. Comput. Sci.
- 2001

Dijkstra’s algorithm solves the single-source shortest path problem on any directed graph in O(m + n log n) worst-case time when… (More)

Is this relevant?