901 search results - page 46 / 181 » On Anonymization of String Data |
ICPR
2002
IEEE
16 years 27 days ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
110
click to vote
DIS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...
106
click to vote
ISMB
1998
15 years 1 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
JSA
2008
14 years 11 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
GI
2010
Springer
14 years 10 months ago
2010
Springer
: Product matching aims at identifying different product offers referring to the same real-world product. Product offers are provided by different merchants and describe products u...