16404 search results - page 647 / 3281 » A set coverage problem |
189
click to vote
COLT
2008
Springer
15 years 9 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
210
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
185
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
In this paper a concern about the accuracy (as a function of parallelism) of a certain class of distributed learning algorithms is raised, and one proposed improvement is illustrat...
184
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
Induction of decision rules within the dominance-based rough set approach to the multiple-criteria sorting decision problem is discussed in this paper. We introduce an algorithm ca...
212
click to vote
COMGEO
2006
ACM
15 years 7 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...