Sciweavers

376 search results - page 27 / 76
» Approximating Probability Distributions Using Small Sample S...
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
COMPGEOM
2011
ACM
12 years 11 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
DRR
2008
13 years 9 months ago
Whole-book recognition using mutual-entropy-driven model adaptation
We describe an approach to unsupervised high-accuracy recognition of the textual contents of an entire book using fully automatic mutual-entropy-based model adaptation. Given imag...
Pingping Xiu, Henry S. Baird
ECCV
2002
Springer
14 years 9 months ago
Bayesian Self-Calibration of a Moving Camera
In this paper, a Bayesian self-calibration approach using sequential importance sampling (SIS) is proposed. Given a set of feature correspondences tracked through an image sequenc...
Gang Qian, Rama Chellappa
TMC
2012
11 years 10 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...