2008 search results - page 196 / 402 » Computing with Equations |
118
click to vote
CGF
1998
15 years 2 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...
100
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The convergence problem of the Laplace-Beltrami operators plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial diff...
126
Voted
MFCS
2010
Springer
15 years 16 days ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
153
Voted
SIAMSC
2010
14 years 9 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
150
Voted
CISS
2010
IEEE
14 years 6 months ago
2010
IEEE
—Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute ...