Sciweavers

79 search results - page 9 / 16
» Optimally combining sampling techniques for Monte Carlo rend...
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
13 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
CGF
2006
183views more  CGF 2006»
13 years 7 months ago
Data-driven Local Coordinate Systems for Image-Based Rendering
Image-based representations of an object profit from known geometry. The more accurate this geometry is known, the better corresponding pixels in the different images can be align...
Gero Müller, Ralf Sarlette, Reinhard Klein
TASLP
2002
109views more  TASLP 2002»
13 years 7 months ago
Particle methods for Bayesian modeling and enhancement of speech signals
This paper applies time-varying autoregressive (TVAR) models with stochastically evolving parameters to the problem of speech modeling and enhancement. The stochastic evolution mod...
Jaco Vermaak, Christophe Andrieu, Arnaud Doucet, S...
ISVC
2009
Springer
14 years 1 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
JMLR
2006
143views more  JMLR 2006»
13 years 7 months ago
Geometric Variance Reduction in Markov Chains: Application to Value Function and Gradient Estimation
We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using s...
Rémi Munos