Sciweavers

225 search results - page 40 / 45
» Approximating Parameterized Convex Optimization Problems
Sort
View
LCN
2005
IEEE
14 years 2 months ago
Simulated Annealing based Localization in Wireless Sensor Network
— In this paper, we describe a novel localization method for ad hoc wireless sensor networks. Accurate selforganization and localization is an essential characteristic of high pe...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
BMVC
2010
13 years 6 months ago
Stratified Generalized Procrustes Analysis
This paper deals with generalized procrustes analysis. This is the problem of registering a set of shape data by finding a reference shape and global rigid transformations given p...
Adrien Bartoli, Daniel Pizarro, Marco Loog
ICML
2009
IEEE
14 years 9 months ago
Regularization and feature selection in least-squares temporal difference learning
We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (L...
J. Zico Kolter, Andrew Y. Ng
IPMI
2007
Springer
14 years 9 months ago
Shape Modeling and Analysis with Entropy-Based Particle Systems
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
Joshua E. Cates, P. Thomas Fletcher, Martin Andrea...
NIPS
1998
13 years 9 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore