Sciweavers

901 search results - page 56 / 181
» On Anonymization of String Data
Sort
View
ICC
2011
IEEE
199views Communications» more  ICC 2011»
13 years 11 months ago
Equal-Sized Cells Mean Equal-Sized Packets in Tor?
Abstract—Tor is a well-known low-latency anonymous communication system. To prevent the traffic analysis attack, Tor packs application data into equal-sized cells. However, we f...
Zhen Ling, Junzhou Luo, Wei Yu, Xinwen Fu
IPPS
2007
IEEE
15 years 6 months ago
Peak-Performance DFA-based String Matching on the Cell Processor
The security of your data and of your network is in the hands of intrusion detection systems, virus scanners and spam filters, which are all critically based on string matching. ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
NIPS
2008
15 years 1 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
SIGMOD
2008
ACM
189views Database» more  SIGMOD 2008»
15 years 12 months ago
Dynamic anonymization: accurate statistical analysis with privacy preservation
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...
Xiaokui Xiao, Yufei Tao
ECML
2004
Springer
15 years 5 months ago
Using String Kernels to Identify Famous Performers from Their Playing Style
Abstract. In this paper we show a novel application of string kernels: that is to the problem of recognising famous pianists from their style of playing. The characterstics of perf...
Craig Saunders, David R. Hardoon, John Shawe-Taylo...