Semantic Scholar uses AI to extract papers important to this topic.
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased… Expand In a previous paper, it was proposed to see the deformations of a common pattern as the action of an infinite dimensional group… Expand XML employs a tree-structured data model, and, naturally, XML queries specify patterns of selection predicates on multiple… Expand XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured… Expand This paper describes a generic model of matching that can be usefully applied to misuse intrusion detection. The model is based… Expand We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X… Expand Abstract This paper studies several topics concerning the way strings can overlap. The key notion of the correlation of two… Expand An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum… Expand This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of… Expand In 1970, Knuth, Pratt, and Morris  showed how to do basic pattern matching in linear time. Related problems, such as those… Expand