15494 search results - page 2735 / 3099 » Computing dynamic clusters |
204
click to vote
SIGGRAPH
2010
ACM
15 years 5 months ago
2010
ACM
Although animation is one of the most compelling aspects of computer graphics, the possibilities for depicting the movement that make dynamic scenes so exciting remain limited for...
199
click to vote
EGH
2010
Springer
15 years 4 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
214
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--The lag of parallel programming models and languages behind the advance of heterogeneous many-core processors has left a gap between the computational capability of moder...
232
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
293
Voted
SPEECH
2011
15 years 1 months ago
2011
Typical speech enhancement methods, based on the short-time Fourier analysis-modification-synthesis (AMS) framework, modify only the magnitude spectrum and keep the phase spectru...