Results 261 to 270 of about 38,188 (290)
Analysis of two-dimensional approximate pattern matching algorithms
Theoretical Computer Science, 1998 We present a new and more rigorous analysis of the two algorithms for two-dimensional approximate pattern matching due to Kärkkäinen and Ukkonen. We also present modifications of these algorithms that use less space while keeping the same expected ...
Park Kunsoo
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Improving an Algorithm for Approximate Pattern Matching
Algorithmica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gonzalo Navarro 0001 +1 more
openaire +1 more source
Approximate pattern matching in a pattern database system
Information Systems, 1980Abstract This work is concerned with the organization of a large database of binary pictures (normalized for size, rotation and position) and with the efficient “inexact match” of an input pattern against the whole database. Current techniques in pattern analysis use matching algorithms without any regard to the global organization of the storage ...
Larry S. Davis, Nick Roussopoulos
openaire +2 more sources
Approximate fingerprinting to accelerate pattern matching
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, 2006Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion detection systems, worm detecting algorithms and many other anomaly detection mechanisms.
Ramaswamy Ramaswamy +2 more
openaire +1 more source
Approximate Pattern Matching Algorithm
2016We propose a fast algorithm of image pattern (instance) matching which is based on an efficient encoding of the pattern and database images. For each image, the encoding produces a matrix of the F-transform components. The matching is then realized by comparing the F-transform components of the pattern and the database images.
Petr Hurtík +2 more
openaire +1 more source
Approximate Pattern Matching in Shared-Forest
2000We present a proposal intended to demonstrate the applicability of tabulation techniques to pattern recognition problems, when dealing with structures sharing some common parts. This work in motivated by the study of information retrieval for textual databases, using pattern matching as a basis for querying data.
Manuel Vilares Ferro +2 more
openaire +1 more source
Approximate pattern matching with samples
1994We simplify in this paper the algorithm by Chang and Lawler for the approximate string matching problem, by adopting the concept of sampling. We have a more general analysis of expected time with the simplified algorithm for the one-dimensional case under a non-uniform probability distribution, and we show that our method can easily be generalized to ...
openaire +1 more source
Exact and Approximate Pattern Matching in the Streaming Model
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009We present a fully online randomized algorithm for the classical pattern matching problem that uses merely O(log m) space, breaking the O(m) barrier that held for this problem for a long time. Our method can be used as a tool in many practical applications, including monitoring Internet traffic and firewall applications.
Benny Porat, Ely Porat
openaire +1 more source
Approximate pattern matching in directed graphs
1996Pattern matching in directed graphs is useful in many areas including type systems, functional languages, regular tree expressions, cyclic term graph rewriting systems and machine translation. We investigate in this paper the problem of directed graph pattern matching allowing some mismatches in labels. Two algorithms for computing the distance between
openaire +1 more source
Simulation-based Approximate Graph Pattern Matching
Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, 2020Graph pattern matching is a fundamental problem in analyzing attributed graphs, that is to search the matches of a given query graph in a large data graph. However, existing algorithms either encounter with the performance issues or cannot capture reasonable matches.
openaire +1 more source