901 search results - page 81 / 181 » On Anonymization of String Data |
RC
2007
15 years 29 days ago
2007
This paper develops easily computed, tight bounds on Generalized Linear Predictors and instrumental variable estimators when outcome data are partially identi…ed. A salient exam...
118
click to vote
VIZSEC
2007
Springer
15 years 7 months ago
2007
Springer
This paper describes Isis, a system that uses progressive multiples of timelines and event plots to support the iterative investigation of intrusions by experienced analysts using ...
FC
2010
Springer
15 years 5 months ago
2010
Springer
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
244
click to vote
VLDB
2002
ACM
16 years 1 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
113
Voted
HOTOS
2007
IEEE
15 years 5 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...