535 search results - page 47 / 107 » Online learning over graphs |
187
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
154
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
169
click to vote
JMLR
2010
15 years 1 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
173
click to vote
AAAI
2012
13 years 9 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
196
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Most existing subspace analysis-based tracking algorithms utilize a flattened vector to represent a target, resulting in a high dimensional data learning problem. Recently, subspa...