425 search results - page 11 / 85 » On the additive constant of the k-server Work Function Algor... |
ALT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
ICCV
2009
IEEE
15 years 20 days ago
2009
IEEE
Random Forests (RFs) have become commonplace
in many computer vision applications. Their
popularity is mainly driven by their high computational
efficiency during both training ...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
ML
2002
ACM
13 years 7 months ago
2002
ACM
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...