1957 search results - page 149 / 392 » Approximate algorithms for neural-Bayesian approaches |
100
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
ICPR
2010
IEEE
14 years 8 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
111
click to vote
ANTSW
2010
Springer
14 years 8 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We present an exact algorithm for the computation of the moments of a region bounded by a curve represented in a scaling function or wavelet basis. Using Green's theorem, we ...