1568 search results - page 125 / 314 » The problem of examination questions in algorithmics |
121
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
144
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
118
click to vote
DATAMINE
2007
15 years 4 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
145
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
123
click to vote
ECML
2005
Springer
15 years 10 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...