136 search results - page 12 / 28 » On the generation of multivariate polynomials which are hard... |
IAJIT
2008
13 years 7 months ago
2008
: 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...
ASIACRYPT
2011
Springer
12 years 7 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
GECCO
2010
Springer
14 years 10 days ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
NA
2007
13 years 7 months ago
2007
Abstract. We discuss periodization of smooth functions f of d variables for approximation of multivariate integrals. The benefit of periodization is that we may use lattice rules,...
ACTA
2008
13 years 6 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...