901 search results - page 18 / 181 » On Anonymization of String Data |
173
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
72
Voted
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
CPM
2010
Springer
15 years 2 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
ADBIS
2007
Springer
15 years 3 months ago
2007
Springer
Although the native (tree-like) storage of XML data becomes more and more important there will be an enduring demand to manage XML data in its textual representation, for instance ...
CANS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Solutions for an easy and secure setup of a wireless connection between two devices are urgently needed for WLAN, Wireless USB, Bluetooth and similar standards for short ...