Sciweavers

537 search results - page 51 / 108
» Methods for Evolving Robust Programs
Sort
View
ICCV
2005
IEEE
14 years 11 months ago
Learning Non-Negative Sparse Image Codes by Convex Programming
Example-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently, non-negative matrix factorization (NMF) ...
Christoph Schnörr, Matthias Heiler
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
14 years 9 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
NIPS
2007
13 years 10 months ago
Receding Horizon Differential Dynamic Programming
The control of high-dimensional, continuous, non-linear dynamical systems is a key problem in reinforcement learning and control. Local, trajectory-based methods, using techniques...
Yuval Tassa, Tom Erez, William D. Smart
MVA
1996
129views Computer Vision» more  MVA 1996»
13 years 10 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
ATAL
2007
Springer
14 years 3 months ago
Knowledge and observations in the situation calculus
We present a powerful new account of multi-agent knowledge in the situation calculus and an effective reasoning procedure for handling knowledge queries. Our approach generalizes...
Ryan F. Kelly, Adrian R. Pearce