Sciweavers

1369 search results - page 176 / 274
» Lattice computations for random numbers
Sort
View
SPAA
2005
ACM
14 years 2 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
DAC
2008
ACM
13 years 11 months ago
Protecting bus-based hardware IP by secret sharing
Our work addresses protection of hardware IP at the mask level with the goal of preventing unauthorized manufacturing. The proposed protocol based on chip locking and activation i...
Jarrod A. Roy, Farinaz Koushanfar, Igor L. Markov
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 9 months ago
On Functional Decomposition of Multivariate Polynomials with Differentiation and Homogenization
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
Shang-Wei Zhao, Ruyong Feng, Xiao-Shan Gao
CVPR
2011
IEEE
13 years 4 months ago
A Global Sampling Method for Alpha Matting
Alpha matting refers to the problem of softly extracting the foreground from an image. Given a trimap (specifying known foreground/background and unknown pixels), a straightforwar...
Kaiming He, Christoph Rhemann, Carsten Rother, Xia...
TOG
2010
134views more  TOG 2010»
13 years 3 months ago
Unbiased, adaptive stochastic sampling for rendering inhomogeneous participating media
Realistic rendering of participating media is one of the major subjects in computer graphics. Monte Carlo techniques are widely used for realistic rendering because they provide u...
Yonghao Yue, Kei Iwasaki, Bing-Yu Chen, Yoshinori ...