5169 search results - page 142 / 1034 » Locality approximation using time |
139
click to vote
CAD
2004
Springer
15 years 4 months ago
2004
Springer
Given a nonsingular compact two-manifold F without boundary, we present methods for establishing a family of surfaces which can approximate F so that each approximant is ambient i...
144
click to vote
AAAI
2000
15 years 6 months ago
2000
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
124
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
130
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
177
click to vote
SCIA
2009
Springer
15 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...