Sciweavers

3123 search results - page 77 / 625
» Focusing on pattern matching
Sort
View
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 3 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
KDID
2004
121views Database» more  KDID 2004»
14 years 11 months ago
Constraint Relaxations for Discovering Unknown Sequential Patterns
The main drawbacks of sequential pattern mining have been its lack of focus on user expectations and the high number of discovered patterns. However, the solution commonly accepted...
Cláudia Antunes, Arlindo L. Oliveira
ICCS
1998
Springer
15 years 2 months ago
Matching in Description Logics: Preliminary Results
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
Franz Baader, Alexander Borgida, Deborah L. McGuin...
ICPR
2008
IEEE
15 years 4 months ago
A new method to obtain the shift-table in Boyer-Moore's string matching algorithm
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
Yang Wang
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
14 years 11 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...