779 search results - page 35 / 156 » Algorithms for the Sample Mean of Graphs |
DAGSTUHL
2007
15 years 1 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
109
click to vote
MANSCI
2007
14 years 11 months ago
2007
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
102
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
156
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
109
click to vote
CCCG
2010
15 years 1 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...