16404 search results - page 864 / 3281 » A set coverage problem |
232
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
215
click to vote
COLT
2008
Springer
15 years 9 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
212
click to vote
SODA
2010
ACM
16 years 5 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
172
click to vote
CIKM
2006
Springer
15 years 11 months ago
2006
Springer
This paper revisits the analysis of annotation propagation from source databases to views defined in terms of conjunctive (SPJ) queries. Given a source database D, an SPJ query Q,...
248
click to vote
NIPS
2007
15 years 9 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...