5329 search results - page 390 / 1066 » The Weighted Majority Algorithm |
182
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
189
click to vote
ICONIP
2009
15 years 4 months ago
2009
In this paper, we introduce a novel incremental subspace based object tracking algorithm. The two major contributions of our work are the Robust PCA based occlusion handling scheme...
189
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
190
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
163
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...