986 search results - page 81 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
171
Voted
JMLR
2012
13 years 6 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
119
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
150
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
127
Voted
FCT
2005
Springer
15 years 9 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
134
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...