Sciweavers

1612 search results - page 67 / 323
» Asynchronous Pattern Matching
Sort
View
FPL
2005
Springer
113views Hardware» more  FPL 2005»
15 years 3 months ago
A Reconfigurable Perfect-Hashing Scheme for Packet Inspection
In this paper, we consider scanning and analyzing packets in order to detect hazardous contents using pattern matching. We introduce a hardware perfect-hashing technique to access...
Ioannis Sourdis, Dionisios N. Pnevmatikatos, Steph...
RSA
2002
73views more  RSA 2002»
14 years 9 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro
LATIN
2004
Springer
15 years 3 months ago
Rotation and Lighting Invariant Template Matching
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
IPL
2007
91views more  IPL 2007»
14 years 9 months ago
Simple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
Peter Clifford, Raphaël Clifford
SPAA
2009
ACM
15 years 7 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...