𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact Bounds for the Stochastic Upward Matching Problem

✍ Scribed by Wansoo T. Rhee and Michel Talagrand

Book ID
125691112
Publisher
American Mathematical Society
Year
1988
Tongue
English
Weight
351 KB
Volume
307
Category
Article
ISSN
0002-9947

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The exact online string matching problem
The exact online string matching problem
✍ Faro, Simone; Lecroq, Thierry πŸ“‚ Article πŸ“… 2013 πŸ› Association for Computing Machinery 🌐 English βš– 418 KB
The exact online string matching problem
The exact online string matching problem
✍ Faro, Simone; Lecroq, Thierry πŸ“‚ Article πŸ“… 2013 πŸ› Association for Computing Machinery 🌐 English βš– 418 KB

This article addresses the __online exact string matching problem__ which consists in finding __all__ occurrences of a given pattern __p__ in a text __t__ . It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal