Sciweavers

901 search results - page 97 / 181
» On Anonymization of String Data
Sort
View
WWW
2003
ACM
16 years 2 months ago
Text joins in an RDBMS for web data integration
The integration of data produced and collected across autonomous, heterogeneous web services is an increasingly important and challenging problem. Due to the lack of global identi...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
DCC
2010
IEEE
15 years 8 months ago
Lossless Data Compression via Substring Enumeration
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
Danny Dubé, Vincent Beaudoin
IJFCS
2006
108views more  IJFCS 2006»
15 years 1 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
MOBISYS
2008
ACM
16 years 1 months ago
Anonysense: privacy-aware people-centric sensing
Personal mobile devices are increasingly equipped with the capability to sense the physical world (through cameras, microphones, and accelerometers, for example) and the network w...
Cory Cornelius, Apu Kapadia, David Kotz, Daniel Pe...
RTA
2010
Springer
15 years 5 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk