Sciweavers

2520 search results - page 424 / 504
» The complexity of approximating entropy
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Iterated smoothing for accelerated gradient convex minimization in signal processing
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...
Tobias Lindstrøm Jensen, Jan Østerga...
CGF
2010
170views more  CGF 2010»
15 years 4 months ago
A Closed-Form Solution to Single Scattering for General Phase Functions and Light Distributions
Due to the intricate nature of the equation governing light transport in participating media, accurately and efficiently simulating radiative energy transfer remains very challeng...
Vincent Pegoraro, Mathias Schott, Steven G. Parker
100
Voted
CGF
2008
78views more  CGF 2008»
15 years 4 months ago
Single-pass Scalable Subsurface Rendering with Lightcuts
This paper presents a new, scalable, single pass algorithm for computing subsurface scattering using the diffusion approximation. Instead of pre-computing a globally conservative ...
Adam Arbree, Bruce Walter, Kavita Bala
152
Voted
CGF
2008
168views more  CGF 2008»
15 years 4 months ago
Interactive Global Illumination for Deformable Geometry in CUDA
Interactive global illumination for fully deformable scenes with dynamic relighting is currently a very elusive goal in the area of realistic rendering. In this work we propose a ...
Arne Schmitz, Markus Tavenrath, Leif Kobbelt
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 4 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler