Sciweavers

6045 search results - page 1004 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Reinforcement Learning with the Use of Costly Features
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
Robby Goetschalckx, Scott Sanner, Kurt Driessens
MM
2010
ACM
170views Multimedia» more  MM 2010»
15 years 6 months ago
Color and luminance compensation for mobile panorama construction
We provide an efficient technique of color and luminance compensation for sequences of overlapping images. It can be used in construction of high-resolution and high-quality panor...
Yingen Xiong, Kari Pulli
CG
2008
Springer
15 years 6 months ago
Tight and efficient surface bounds in meshless animation
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
Denis Steinemann, Miguel A. Otaduy, Markus H. Gros...
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 6 months ago
Infinity-Norm Sphere-Decoding
Abstract--Promising approaches for efficient detection in multiple-input multiple-output (MIMO) wireless systems are based on sphere-decoding (SD). The conventional (and optimum) n...
Dominik Seethaler, Helmut Bölcskei
CG
2004
Springer
15 years 6 months ago
Surface processing methods for point sets using finite elements
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...
Ulrich Clarenz, Martin Rumpf, Alexandru Telea
« Prev « First page 1004 / 1209 Last » Next »