569 search results - page 76 / 114 » Online Bounds for Bayesian Algorithms |
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
TIP
2008
14 years 9 months ago
2008
Significant appearance changes of objects under different orientations could cause loss of tracking, "drifting." In this paper, we present a collaborative tracking framew...
COLT
2007
Springer
15 years 4 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
108
click to vote
JMLR
2008
14 years 9 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
104
click to vote
IOR
2010
14 years 8 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...