16404 search results - page 676 / 3281 » A set coverage problem |
242
click to vote
CIKM
2011
Springer
14 years 7 months ago
2011
Springer
Social (or folksonomic) tagging has become a very popular way to describe content within Web 2.0 websites. However, as tags are informally defined, continually changing, and ungo...
192
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—Deploying home access points (AP) is hard. Untrained users typically purchase, install, and configure a home AP with very little awareness of wireless signal coverage a...
226
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
172
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
166
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...