1074 search results - page 34 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
MST
2011
14 years 4 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
103
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
ALGORITHMICA
2010
14 years 9 months ago
2010
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
102
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
90
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We1 present a new actor-critic learning model in which a Bayesian class of non-parametric critics, using Gaussian process temporal difference learning is used. Such critics model ...