Sciweavers

779 search results - page 21 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
ML
2008
ACM
152views Machine Learning» more  ML 2008»
14 years 9 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
MP
2007
75views more  MP 2007»
14 years 9 months ago
Solving maximum-entropy sampling problems using factored masks
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
Samuel Burer, Jon Lee
77
Voted
ICPR
2008
IEEE
15 years 11 months ago
A hierarchical model for the evaluation of biometric sample quality
The evaluation of biometric sample quality is of great importance in the evaluation of biometric algorithms. In this paper, we propose a novel hierarchical model to compute the sa...
Qian He, Tieniu Tan, Yong Zou, Zhenan Sun
ICIAP
2007
ACM
15 years 10 months ago
An information theoretic rule for sample size adaptation in particle filtering
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...
Oswald Lanz
ICRA
2007
IEEE
165views Robotics» more  ICRA 2007»
15 years 4 months ago
Adaptive Sampling for Estimating a Scalar Field using a Robotic Boat and a Sensor Network
Abstract— This paper introduces an adaptive sampling algorithm for a mobile sensor network to estimate a scalar field. The sensor network consists of static nodes and one mobile...
Bin Zhang, Gaurav S. Sukhatme