3819 search results - page 156 / 764 » Simple Easy Terms |
202
click to vote
WSCG
2003
15 years 8 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
190
click to vote
ICISC
1998
15 years 8 months ago
1998
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
166
click to vote
WSC
2000
15 years 8 months ago
2000
A graphical discrete event simulation library is proposed for system simulation that is based on interacting concurrent processes. This library works with EXTEND (Imagine That Inc...
150
click to vote
MVA
1994
15 years 8 months ago
1994
This pqm pments a rasterbased algorithm for reconstruction of 3-D terrain data from contour information appearing on the conventional 2-D map The height of an interior point betwe...
185
click to vote
OSDI
1994
ACM
15 years 8 months ago
1994
ACM
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...