Sciweavers

4981 search results - page 646 / 997
» Dependent Gaussian Processes
Sort
View
UAI
2008
15 years 9 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht
AAAI
2006
15 years 9 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
ACL
2006
15 years 9 months ago
The Benefit of Stochastic PP Attachment to a Rule-Based Parser
To study PP attachment disambiguation as a benchmark for empirical methods in natural language processing it has often been reduced to a binary decision problem (between verb or n...
Kilian A. Foth, Wolfgang Menzel
CLA
2004
15 years 9 months ago
Emulating a Cooperative Behavior in a Generic Association Rule Visualization Tool
Traditional framework for mining association rules has pointed out the derivation of many redundant rules. In order to be reliable in a decision making process, such discovered rul...
I. Nsir, Sadok Ben Yahia, Engelbert Mephu Nguifo
CGVR
2006
15 years 9 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger