Sciweavers

910 search results - page 29 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
ICVGIP
2004
15 years 4 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
ICPR
2006
IEEE
16 years 4 months ago
Matching 2D Shapes using their Symmetry Sets
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...
Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter...
ICARIS
2004
Springer
15 years 8 months ago
Online Negative Databases
The benefits of negative detection for obscuring information are explored in the context of Artificial Immune Systems (AIS). AIS based on string matching have the potential for a...
Fernando Esponda, Elena S. Ackley, Stephanie Forre...
JCDL
2004
ACM
94views Education» more  JCDL 2004»
15 years 8 months ago
Element matching in concept maps
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
Byron Marshall, Therani Madhusudan
CPM
1998
Springer
132views Combinatorics» more  CPM 1998»
15 years 7 months ago
Reporting Exact and Approximate Regular Expression Matches
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
Eugene W. Myers, Paulo Oliva, Katia S. Guimar&atil...