Sciweavers

1715 search results - page 260 / 343
» Point Sample Rendering
Sort
View
122
Voted
SIGGRAPH
1993
ACM
15 years 4 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
VCIP
2001
199views Communications» more  VCIP 2001»
15 years 2 months ago
Estimation of large-amplitude motion and disparity fields: application to intermediate view reconstruction
This paper describes a method for establishing dense correspondence between two images in a video sequence (motion) or in a stereo pair (disparity) in case of large displacements....
Moustapha Kardouchi, Janusz Konrad, Carlos V&aacut...
93
Voted
BMCBI
2008
78views more  BMCBI 2008»
15 years 26 days ago
Evaluation of time profile reconstruction from complex two-color microarray designs
Background: As an alternative to the frequently used "reference design" for two-channel microarrays, other designs have been proposed. These designs have been shown to b...
Ana C. Fierro, Raphael Thuret, Kristof Engelen, Gi...
141
Voted
CGF
2010
141views more  CGF 2010»
14 years 10 months ago
A Survey of Procedural Noise Functions
Procedural noise functions are widely used in Computer Graphics, from off-line rendering in movie production to interactive video games. The ability to add complex and intricate d...
Ares Lagae, Sylvain Lefebvre, R. Cook, T. DeRose, ...
83
Voted
KDD
2003
ACM
109views Data Mining» more  KDD 2003»
16 years 1 months ago
Experimental design for solicitation campaigns
Data mining techniques are routinely used by fundraisers to select those prospects from a large pool of candidates who are most likely to make a financial contribution. These tech...
Uwe F. Mayer, Armand Sarkissian