1464 search results - page 219 / 293 » On optimal anonymization for l -diversity |
135
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
155
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
161
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
One of the most well-studied problems in data mining is computing association rules from large transactional databases. Often, the rule collections extracted from existing datamin...
172
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
To obtain correlated and complementary information contained in text mining and bibliometrics, hybrid clustering to incorporate textual content and citation information has become...
172
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
Existing schemes for cache energy optimization incorporate a limited degree of dynamic associativity: either direct mapped or full available associativity (say 4-way). In this pap...