75 search results - page 14 / 15 » Iterated Runge-Kutta methods on distributed memory multiproc... |
SPIN
2007
Springer
13 years 11 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
VTC
2007
IEEE
13 years 11 months ago
2007
IEEE
— We design a coding scheme for Costa’s dirty paper coding (DPC) [6] using a channel and a shaping code. We show that by transforming the channel noise distribution the DPC cha...
TOG
2002
13 years 4 months ago
2002
This paper presents a solution for texture mapping unparameterized models. The quality of a texture on a model is often limited by the model's parameterization into a 2D text...
BICOB
2009
Springer
13 years 12 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
CGF
1998
13 years 5 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...