Sciweavers

169 search results - page 1 / 34
» Matrix Computations Using Quasirandom Sequences
Sort
View
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
13 years 8 months ago
Matrix Computations Using Quasirandom Sequences
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...
Michael Mascagni, Aneta Karaivanova
LSSC
2001
Springer
13 years 8 months ago
Solving Systems of Linear Algebraic Equations Using Quasirandom Numbers
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
Aneta Karaivanova, Rayna Georgieva
ECCV
2000
Springer
14 years 6 months ago
Quasi-Random Sampling for Condensation
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
Vasanth Philomin, Ramani Duraiswami, Larry S. Davi...
CEC
2008
IEEE
13 years 10 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
LSSC
2001
Springer
13 years 8 months ago
A Quasi-Monte Carlo Method for Integration with Improved Convergence
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
Aneta Karaivanova, Ivan Dimov, Sofiya Ivanovska