901 search results - page 68 / 181 » On Anonymization of String Data |
CSR
2006
Springer
15 years 3 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
ASIACRYPT
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We first propose the notion of universally anonymizable publickey encryption. Suppose that we have the encrypted data made with the same security parameter, and that the...
128
click to vote
EDBT
2004
ACM
16 years 1 hour ago
2004
ACM
In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many...
94
Voted
CPM
2001
Springer
15 years 4 months ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
MST
2006
14 years 11 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...