Back to Results
First PageMeta Content
String matching algorithms / Computational complexity theory / Donald Knuth / Knuth–Morris–Pratt algorithm / Time complexity / String searching algorithm / Matching / Approximate string matching / Levenshtein distance / Theoretical computer science / Applied mathematics / Dynamic programming


Pattern matching in pseudo real-time Rapha¨el Clifforda , Benjamin Sacha,∗ a Department of Computer Science, University of Bristol,UK
Add to Reading List

Document Date: 2014-03-11 07:07:17


Open Document

File Size: 272,44 KB

Share Result on Facebook

Facility

University of Bristol / /

IndustryTerm

deterministic solution / online computation / offline algorithms / Internet traffic / char time Online/PsR penalty Method / while processing / online pattern matching / online ones / offline algorithm / online problem / pseudo real-time translation / offline solution / linear time online algorithm / balanced binary search tree / telecommunications / cross-correlation algorithm / online pattern matching algorithms / real-time algorithm / real-time cross-correlation method / randomised offline algorithm / online algorithm / non-amortised online ones / black box solution / online algorithms / online setting / binary search tree / online integer multiplication / approximate pattern matching algorithms / /

Organization

University of Bristol / Department of Computer Science / /

Person

Clifford / Benjamin Sacha / /

Position

Corresponding author / /

Product

Galil / /

Technology

approximate pattern matching algorithms / linear time online algorithm / cross-correlation algorithm / RAM / real-time algorithm / character PsR algorithm / PsR algorithm / online pattern matching algorithms / randomised offline algorithm / resulting online algorithms / KMP algorithm / corresponding offline algorithms / specific offline algorithm / offline algorithm / /

SocialTag