53 search results - page 9 / 11 » Efficient Algorithms for Approximating Polygonal Chains |
UAI
2008
13 years 9 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
RT
2001
Springer
14 years 1 days ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
ADT
2005
13 years 7 months ago
2005
In this paper we present a new framework, based on subdivision surface approximation, for efficient compression and coding of 3D models represented by polygonal meshes. Our algorit...