87 search results - page 6 / 18 » A Theoretical Comparison of Monte Carlo Radiosity Algorithms |
94
Voted
NAA
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
142
click to vote
CODCRY
2011
Springer
14 years 1 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
79
Voted
DAC
2000
ACM
15 years 10 months ago
2000
ACM
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
121
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...