Sciweavers

NIPS
1998
13 years 6 months ago
Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
Michael S. Lewicki, Terrence J. Sejnowski
AIPS
2006
13 years 6 months ago
Solving Factored MDPs with Exponential-Family Transition Models
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
AAAI
2006
13 years 6 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
VMV
2008
187views Visualization» more  VMV 2008»
13 years 6 months ago
Patch-Graph Reconstruction for Piecewise Smooth Surfaces
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
Philipp Jenke, Michael Wand, Wolfgang Straße...
NIPS
2007
13 years 6 months ago
Learning Horizontal Connections in a Sparse Coding Model of Natural Images
It has been shown that adapting a dictionary of basis functions to the statistics of natural images so as to maximize sparsity in the coefficients results in a set of dictionary ...
Pierre Garrigues, Bruno Olshausen
ICMLA
2008
13 years 6 months ago
Basis Function Construction in Reinforcement Learning Using Cascade-Correlation Learning Architecture
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
Sertan Girgin, Philippe Preux
ESANN
2007
13 years 6 months ago
Controlling complexity of RBF networks by similarity
Abstract. Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring techni...
Ulrich Rückert, Ralf Eickhoff
DAGM
2008
Springer
13 years 6 months ago
Optical Rails
We present a view-based method for steering a robot in a network of positions; this includes navigation along a prerecorded path, but also allows for arbitrary movement of the robo...
Holger Friedrich, David Dederscheck, Eduard Rosert...
AIPS
2007
13 years 7 months ago
Learning to Plan Using Harmonic Analysis of Diffusion Models
This paper summarizes research on a new emerging framework for learning to plan using the Markov decision process model (MDP). In this paradigm, two approaches to learning to plan...
Sridhar Mahadevan, Sarah Osentoski, Jeffrey Johns,...
AAAI
2007
13 years 7 months ago
Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
A new spectral approach to value function approximation has recently been proposed to automatically construct basis functions from samples. Global basis functions called proto-val...
Jeffrey Johns, Sridhar Mahadevan, Chang Wang