205 search results - page 35 / 41 » On Parameterized Approximability |
AAAI
2000
13 years 8 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 ...
CGF
2010
13 years 7 months ago
2010
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...
TIP
2008
13 years 7 months ago
2008
We introduce a nonlocal discrete regularization framework on weighted graphs of the arbitrary topologies for image and manifold processing. The approach considers the problem as a...
TSP
2008
13 years 7 months ago
2008
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structure...
VC
2008
13 years 7 months ago
2008
It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, n...