Sciweavers

4277 search results - page 630 / 856
» On Multiple Linear Approximations
Sort
View
CGF
2008
78views more  CGF 2008»
15 years 6 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
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 6 months ago
Fast space-variant elliptical filtering using box splines
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 6 months ago
Fishing in Poisson streams: focusing on the whales, ignoring the minnows
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
Maxim Raginsky, Sina Jafarpour, Rebecca Willett, A...
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 6 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...