1272 search results - page 41 / 255 » The Set Cover with Pairs Problem |
119
Voted
FAW
2008
Springer
15 years 5 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
141
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
110
click to vote
CCCG
2010
15 years 5 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
134
Voted
IJCAI
2007
15 years 5 months ago
2007
We describe an approach to extract attribute-value pairs from product descriptions. This allows us to represent products as sets of such attribute-value pairs to augment product d...
146
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...