Sciweavers

746 search results - page 21 / 150
» Fast (Structured) Newton Computations
Sort
View
CGF
2008
83views more  CGF 2008»
13 years 7 months ago
Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays
Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths th...
Holger Dammertz, Johannes Hanika, Alexander Keller
QEST
2008
IEEE
14 years 2 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
NIPS
2008
13 years 9 months ago
Fast Prediction on a Tree
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
Mark Herbster, Massimiliano Pontil, Sergio Rojas G...
ICS
1992
Tsinghua U.
13 years 11 months ago
The CODE 2.0 graphical parallel programming language
CODE 2.0 is a graphical parallel programming system that targets the three goals of ease of use, portability, and production of efficient parallel code. Ease of use is provided by...
Peter Newton, James C. Browne
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Fitted BVH for Fast Raytracing of Metaballs
Raytracing metaballs is a problem that has numerous applications in the rendering of dynamic soft objects such as fluids. However, current techniques are either limited in the vi...
Olivier Gourmel, Anthony Pajot, Mathias Paulin, Lo...