536 search results - page 27 / 108 » The hardness and approximation algorithms for l-diversity |
125
click to vote
DLOG
2009
14 years 9 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
105
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
116
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
102
click to vote
AMC
2006
14 years 12 months ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...