VLDB
2006
ACM
15 years 20 days ago
2006
ACM
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
Abstract We explore the problem of portable and flexible privacy preserving access rights that permit access to a large collection of digital goods. Privacy-preserving access contr...
106
click to vote
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
Abstract The protection of customer privacy is a fundamental issue in today's corporate marketing strategies. Not surprisingly, many research efforts have proposed new privacy...
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
103
click to vote
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
107
click to vote
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
105
click to vote
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
VLDB
2006
ACM
15 years 20 days ago
2006
ACM
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...