536 search results - page 101 / 108 » The hardness and approximation algorithms for l-diversity |
STOC
2009
ACM
14 years 7 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
KDD
2003
ACM
14 years 7 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
KDD
2001
ACM
14 years 7 months ago
2001
ACM
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...