16404 search results - page 374 / 3281 » A set coverage problem |
150
Voted
COLT
1997
Springer
15 years 10 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
150
click to vote
FOCM
2010
15 years 4 months ago
2010
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
177
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
184
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
143
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...