✦ LIBER ✦

Optimal On-Line Search and Sublinear Time Update in String Matching

✍ Scribed by Ferragina, Paolo; Grossi, Roberto

Book ID: 118177449
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 500 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539795286119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multi-Dimensional Pattern Matching with

Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms

✍ Raffaele Giancarlo; Roberto Grossi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 434 KB

We introduce a new multidimensional pattern matching problem that is a Ž natural generalization of string matching, a well studied problem A. V. Aho, Ž . ''Handbook of Theoretical Computer Science'' J. van Leeuwen, Ed. , pp. 257᎐295, . Elsevier, Amsterdam, 1990 . The motivation for its algorithmic s

Stochastic searching on the line and its

Stochastic searching on the line and its applications to parameter learning in nonlinear optimization

✍ Oommen, B.J. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 197 KB

Optimal boundary control by an elastic f

Optimal boundary control by an elastic force at one end and a displacement at the other end for an arbitrary sufficiently large time interval in the string vibration problem

✍ L. I. Bloshanskaya; I. N. Smirnov 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 318 KB