Sciweavers

1333 search results - page 79 / 267
» Not a Number of Floating Point Problems
Sort
View
153
Voted
CG
2005
Springer
15 years 3 months ago
Adaptive density estimation using an orthogonal series for global illumination
In Monte-Carlo photon-tracing methods energy-carrying particles are traced in an environment to generate hit points on object surfaces for simulating global illumination. The surf...
Kam Wah Wong, Wenping Wang
CVPR
1999
IEEE
16 years 5 months ago
A Novel Bayesian Method for Fitting Parametric and Non-Parametric Models to Noisy Data
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done ...
Michael Werman, Daniel Keren
102
Voted
STOC
2002
ACM
103views Algorithms» more  STOC 2002»
16 years 3 months ago
Approximate clustering via core-sets
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
115
Voted
CCCG
2006
15 years 5 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
166
Voted
CVPR
2012
IEEE
13 years 6 months ago
Micro Phase Shifting
We consider the problem of shape recovery for real world scenes, where a variety of global illumination (interreflections, subsurface scattering, etc.) and illumination defocus e...
Mohit Gupta, Shree K. Nayar