Sciweavers

590 search results - page 39 / 118
» Resolution-stationary random number generators
Sort
View
WSCG
2004
142views more  WSCG 2004»
15 years 5 months ago
Metropolis Iteration for Global Illumination
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
László Szirmay-Kalos, Bálazs ...
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 8 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
NAACL
2007
15 years 5 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
DCC
2007
IEEE
16 years 4 months ago
On binary signed digit representations of integers
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several b...
Nevine Maurice Ebeid, M. Anwar Hasan
CTRSA
2010
Springer
200views Cryptology» more  CTRSA 2010»
15 years 11 months ago
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
Typical security models used for proving security of deployed cryptographic primitives do not allow adversaries to rewind or reset honest parties to an earlier state. Thus, it is c...
Scott Yilek