16404 search results - page 249 / 3281 » A set coverage problem |
141
click to vote
JCIT
2010
14 years 11 months ago
2010
The aim of this paper is to investigate the multiple attribute decision making problems with intuitionistic fuzzy information, in which the information about attribute weights is ...
145
click to vote
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
155
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
132
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
151
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...