537 search results - page 51 / 108 » Methods for Evolving Robust Programs |
105
click to vote
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
Example-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently, non-negative matrix factorization (NMF) ...
107
Voted
STOC
2007
ACM
16 years 2 months ago
2007
ACM
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...
99
Voted
NIPS
2007
15 years 3 months ago
2007
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...
120
Voted
MVA
1996
15 years 3 months ago
1996
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 ...
109
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
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...