Sciweavers

1693 search results - page 132 / 339
» fast 2008
Sort
View
CGF
2008
109views more  CGF 2008»
13 years 10 months ago
Occlusion Textures for Plausible Soft Shadows*
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
Elmar Eisemann, Xavier Décoret
CHINAF
2008
69views more  CHINAF 2008»
13 years 10 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
IAJIT
2008
131views more  IAJIT 2008»
13 years 10 months ago
Shadow Casting with Stencil Buffer for Real-Time Rendering
: We present a new method for real-time rendering of soft shadows in dynamic scenes. Our approach is based on shadow volume algorithm which provides fast, accurate and high quality...
Mohd Shafry Mohd Rahim, Daut Daman
COR
2006
75views more  COR 2006»
13 years 10 months ago
A new heuristic recursive algorithm for the strip rectangular packing problem
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heurist...
Defu Zhang, Yan Kang, Ansheng Deng
CSDA
2007
172views more  CSDA 2007»
13 years 10 months ago
AMCMC: An R interface for adaptive MCMC
We describe AMCMC, a software package for running adaptive MCMC algorithms on user-supplied density functions. AMCMC provides the user with an R interface, which in turn calls C pr...
Jeffrey S. Rosenthal