LATIN
1998
Springer
13 years 11 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
COMPGEOM
1999
ACM
13 years 11 months ago
1999
ACM
In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignm...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
AINA
2010
IEEE
14 years 8 days ago
2010
IEEE
—Network Intrusion Detection System (NIDS) is a system which can detect network attacks resulted from worms and viruses on the Internet. An efficient pattern matching algorithm p...
CC
2003
Springer
14 years 19 days ago
2003
Springer
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
ICCAD
2003
IEEE
14 years 21 days ago
2003
IEEE
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
ISMIR
2004
Springer
14 years 24 days ago
2004
Springer
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
ISMIR
2004
Springer
14 years 24 days ago
2004
Springer
We propose an algorithm, MusicBLAST, for approximate pattern search/matching on symbolic musical data. MusicBLAST is based on the BLAST algorithm, one of the most commonly used al...
IFIP
2004
Springer
14 years 24 days ago
2004
Springer
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
FLOPS
2004
Springer
14 years 24 days ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...