Sciweavers

11565 search results - page 312 / 2313
» Computing Minimal Mappings
Sort
View
IPPS
1993
IEEE
15 years 11 months ago
Mapping to Reduce Contention in Multiprocessor Architectures
Reducingcommunicationoverheadhas been widely recognized as a requirement for achieving efficient mappings which substantially reduce the execution time of parallel algorithms. Th...
Loren Schwiebert, D. N. Jayasimha
ESANN
2008
15 years 8 months ago
Self-Organizing Maps for cyclic and unbounded graphs
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
VMV
2000
146views Visualization» more  VMV 2000»
15 years 8 months ago
Efficient Importance Sampling Techniques for the Photon Map
In global illumination computations the photon map is a powerful tool for approximating the irradiance, which is stored independent from scene geometry. By presenting a new algori...
Alexander Keller, Ingo Wald
CORR
2010
Springer
208views Education» more  CORR 2010»
15 years 6 months ago
MapReduce for Integer Factorization
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Javier Tordable
CAD
2007
Springer
15 years 6 months ago
The spherical visibility map
We introduce a novel representation for visibility in three dimensions and describe an efficient algorithm to construct it. The data structure is a spherical map that consists of...
Todd Keeler, John Fedorkiw, Sherif Ghali