Sciweavers

901 search results - page 37 / 181
» On Anonymization of String Data
Sort
View
INFOVIS
2002
IEEE
15 years 4 months ago
Arc Diagrams: Visualizing Structure in Strings
This paper introduces a new visualization method, the arc diagram, which is capable of representing complex patterns of repetition in string data. Arc diagrams improve over previo...
Martin Wattenberg
CORR
2007
Springer
88views Education» more  CORR 2007»
14 years 11 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
92
Voted
PODS
2006
ACM
216views Database» more  PODS 2006»
15 years 12 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
KDD
2006
ACM
166views Data Mining» more  KDD 2006»
16 years 5 days ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
15 years 11 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos