536 search results - page 5 / 108 » The hardness and approximation algorithms for l-diversity |
PODS
2007
ACM
14 years 8 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
ICAC
2006
IEEE
14 years 1 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
EDBT
2010
ACM
14 years 2 months ago
2010
ACM
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...