Sciweavers

4591 search results - page 194 / 919
» The Global Computer
Sort
View
WSCG
2003
142views more  WSCG 2003»
15 years 5 months ago
Dynamic Radiosity using Higher Order Functions Bases and Temporal Coherence
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...
Venceslas Biri, Sylvain Michelin, Didier Arqu&egra...
IJCV
2008
186views more  IJCV 2008»
15 years 4 months ago
Multi-Class Segmentation with Relative Location Prior
Multi-class image segmentation has made significant advances in recent years through the combination of local and global features. One important type of global feature is that of i...
Stephen Gould, Jim Rodgers, David Cohen, Gal Elida...
EUROPAR
2006
Springer
15 years 7 months ago
Toward a Definition of and Linguistic Support for Partial Quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
ISIPTA
1999
IEEE
103views Mathematics» more  ISIPTA 1999»
15 years 8 months ago
A Review of Propagation Algorithms for Imprecise Probabilities
This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...
Andrés Cano, Serafín Moral
VMV
2000
146views Visualization» more  VMV 2000»
15 years 5 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