901 search results - page 58 / 181 » On Anonymization of String Data |
NAR
2007
14 years 11 months ago
2007
Information on protein–protein interactions is still mostly limited to a small number of model organisms, and originates from a wide variety of experimental and computational te...
SPIRE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
108
click to vote
IJCAI
2003
15 years 1 months ago
2003
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
FSKD
2008
Springer
15 years 28 days ago
2008
Springer
Preservation of privacy in micro-data release is a challenging task in data mining. The k-anonymity method has attracted much attention of researchers. Quasiidentifier is a key co...