901 search results - page 101 / 181 » On Anonymization of String Data |
129
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
Recent work in deduplication has shown that collective deduplication of different attribute types can improve performance. But although these techniques cluster the attributes col...
120
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
110
click to vote
KDD
2003
ACM
16 years 1 months ago
2003
ACM
A large amount of information on the Web is contained in regularly structured objects, which we call data records. Such data records are important because they often present the e...
STACS
2009
Springer
15 years 8 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
106
click to vote
KDD
2001
ACM
16 years 1 months ago
2001
ACM
In this paper, a multimedia data mining framework for discovering important but previously unknown knowledge such as vehicle identification, traffic flow, and the spatio-temporal ...