Sciweavers

1748 search results - page 288 / 350
» Acceleration of the EM algorithm
Sort
View
SI3D
2005
ACM
15 years 11 months ago
Automatic impostor placement for guaranteed frame rates and low memory requirements
Impostors are image-based primitives commonly used to replace complex geometry in order to reduce the rendering time needed for displaying complex scenes. However, a big problem i...
Stefan Jeschke, Michael Wimmer, Heidrun Schumann, ...
IMR
2004
Springer
15 years 11 months ago
Intuitive, Interactive, and Robust Modification and Optimization of Finite Element Models
Virtual prototyping and numerical simulations are increasingly replacing real mock-ups and experiments in industrial product development. Many of these simulations, e.g. for the p...
Katrin Bidmon, Dirc Rose, Thomas Ertl
RT
2004
Springer
15 years 11 months ago
CC Shadow Volumes
We present a technique that uses culling and clamping (CC) for accelerating the performance of stencil-based shadow volume computation. Our algorithm reduces the fill requirement...
Brandon Lloyd, Jeremy Wend, Naga K. Govindaraju, D...
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
15 years 11 months ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
SIGGRAPH
2003
ACM
15 years 11 months ago
Fast texture synthesis on arbitrary meshes
While texture synthesis on surfaces has received much attention in computer graphics, the ideal solution that quickly produces high-quality textures with little user intervention ...
Sebastian Magda, David J. Kriegman