Sciweavers

1523 search results - page 92 / 305
» The Computational Complexity of Linear Optics
Sort
View
WSC
1997
13 years 10 months ago
Computational Efficiency Evaluation in Output Analysis
A central quantity in steady-state simulation is the time-average variance constant. Estimates of this quantity are needed (for example) for constructing confidence intervals, an...
Halim Damerdji, Shane G. Henderson, Peter W. Glynn
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 2 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
TASLP
2008
120views more  TASLP 2008»
13 years 8 months ago
Rapid Speaker Adaptation Using Clustered Maximum-Likelihood Linear Basis With Sparse Training Data
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
Yun Tang, Richard Rose
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 8 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
PSD
2004
Springer
132views Database» more  PSD 2004»
14 years 2 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro