16404 search results - page 268 / 3281 » A set coverage problem |
226
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
Queries with (equality or LIKE) selection predicates over string attributes are widely used in relational databases. However, state-of-the-art techniques for estimating selectivit...
127
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
139
click to vote
IJCGA
2006
15 years 4 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
127
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
146
click to vote
COCO
2004
Springer
15 years 8 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...