779 search results - page 43 / 156 » Algorithms for the Sample Mean of Graphs |
156
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
165
click to vote
ILP
2007
Springer
15 years 10 months ago
2007
Springer
Structural Statistical Software Testing (SSST) exploits the control flow graph of the program being tested to construct test cases. Specifically, SSST exploits the feasible paths...
148
click to vote
NIPS
1997
15 years 5 months ago
1997
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
163
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
149
click to vote
BPM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...