Sciweavers

1513 search results - page 69 / 303
» Cryptographic Pattern Matching
Sort
View
ICALP
2005
Springer
15 years 10 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
AMAST
2010
Springer
14 years 11 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte
CVPR
2005
IEEE
16 years 6 months ago
Fast Spatial Pattern Discovery Integrating Boosting with Constellations of Contextual Descriptors
We present a novel approach for fast object class recognition incorporating contextual information into boosting. The object is represented as a constellation of generalized corre...
Jaume Amores, Nicu Sebe, Petia Radeva
IFIPTCS
2000
15 years 8 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
GBRPR
2007
Springer
15 years 10 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke