Sciweavers

1612 search results - page 76 / 323
» Asynchronous 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...
PROCOMET
1998
14 years 11 months ago
Bisimulations in the join-calculus
We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact o...
Michele Boreale, Cédric Fournet, Cosimo Lan...
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...
IPPS
1997
IEEE
15 years 2 months ago
MTIO - A Multi-Threaded Parallel I/O System
This paper presents the design and evaluation of a multithreaded runtime library for parallel I/O. We extend the multi-threading concept to separate the compute and I/O tasks in t...
Sachin More, Alok N. Choudhary, Ian T. Foster, Min...
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