Sciweavers

502 search results - page 25 / 101
» On the Consistency of Bayesian Function Approximation Using ...
Sort
View
HCI
2007
13 years 9 months ago
Context-Aware Information Agents for the Automotive Domain Using Bayesian Networks
To reduce the workload of the driver due to the increasing amount of information and functions, intelligent agents represent a promising possibility to filter the immense data sets...
Markus Ablaßmeier, Tony Poitschke, Stefan Re...
AAAI
2007
13 years 10 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 7 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux
IJIT
2004
13 years 9 months ago
Multiresolution Approach to Subpixel Registration by Linear Approximation of PSF
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...
Erol Seke, Kemal Özkan
ICIP
2005
IEEE
14 years 9 months ago
Hexagonal versus orthogonal lattices: a new comparison using approximation theory
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
Laurent Condat, Dimitri Van De Ville, Thierry Blu