901 search results - page 47 / 181 » On Anonymization of String Data |
JDA
2008
14 years 11 months ago
2008
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, ...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
194
click to vote
SIGMOD
2009
ACM
16 years 1 days ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
196
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
WWW
2007
ACM
16 years 15 days ago
2007
ACM
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...