1272 search results - page 31 / 255 » The Set Cover with Pairs Problem |
91
Voted
CCCG
2008
15 years 2 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
104
Voted
NIPS
2007
15 years 2 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
80
Voted
ECML
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We consider the problem of learning a mapping from question to answer messages. The training data for this problem consist of pairs of messages that have been received an...
DAM
2008
15 years 23 days ago
2008
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
78
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...