901 search results - page 128 / 181 » On Anonymization of String Data |
ALGORITHMICA
2010
15 years 1 months ago
2010
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
102
click to vote
CJ
1999
15 years 1 months ago
1999
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
JOT
2010
14 years 12 months ago
2010
entional vulnerability detection fails to extend its generic form to an abstract level in coping with particular type of string validation. Consequently the security bypasses key ...
ACL
2009
14 years 11 months ago
2009
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of Ngram language models based on LOUDS, a succinct data stru...
122
click to vote
ACL
2012
13 years 3 months ago
2012
In this paper, we address the issue for learning better translation consensus in machine translation (MT) research, and explore the search of translation consensus from similar, r...