1272 search results - page 36 / 255 » The Set Cover with Pairs Problem |
113
Voted
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
69
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
116
Voted
CORR
2006
Springer
15 years 22 days ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
108
click to vote
QSIC
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
126
click to vote
FOCM
2010
14 years 11 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...