Sciweavers

2957 search results - page 512 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
ICASSP
2010
IEEE
13 years 8 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»
13 years 7 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
CGF
2008
78views more  CGF 2008»
13 years 7 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
CGF
2008
168views more  CGF 2008»
13 years 7 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