Sciweavers

591 search results - page 33 / 119
» Implementing Joins Using Extensible Pattern Matching
Sort
View
83
Voted
ICASSP
2010
IEEE
14 years 9 months ago
Partial sequence matching using an Unbounded Dynamic Time Warping algorithm
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
Xavier Anguera, Robert Macrae, Nuria Oliver
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 1 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
PETRA
2009
ACM
15 years 4 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
69
Voted
FPGA
2009
ACM
285views FPGA» more  FPGA 2009»
15 years 4 months ago
PERG-Rx: a hardware pattern-matching engine supporting limited regular expressions
PERG is a pattern matching engine designed for locating predefined byte string patterns (rules) from the ClamAV virus signature database in a data stream. This paper presents PERG...
Johnny Tsung Lin Ho, Guy G. Lemieux
DBPL
1993
Springer
104views Database» more  DBPL 1993»
15 years 1 months ago
Extensible Grammars for Language Specialization
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Luca Cardelli, Florian Matthes, Martín Abad...