901 search results - page 50 / 181 » On Anonymization of String Data |
204
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
119
click to vote
BALT
2006
15 years 3 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
117
click to vote
SIGIR
2011
ACM
14 years 2 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
KDD
2008
ACM
16 years 7 days ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...