Sciweavers

10051 search results - page 72 / 2011
» A Dynamic Separator Algorithm
Sort
View
103
Voted
ICA
2004
Springer
15 years 6 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 5 months ago
BBOB-benchmarking two variants of the line-search algorithm
The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two different univariate search algorithms (fminbnd from MATLAB and STEP) were...
Petr Posik
ICPP
1989
IEEE
15 years 4 months ago
Efficient Serial and Parallel Algorithms for Median Filtering
We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM al...
Sanjay Ranka, Sartaj Sahni
107
Voted
IJON
2006
73views more  IJON 2006»
15 years 17 days ago
Optimal selection of time lags for TDSEP based on genetic algorithm
In this letter, a two-step learning scheme for the optimal selection of time lags is proposed for a typical temporal blind source separation (TBSS), Temporal Decorrelation source ...
Zhan-Li Sun, De-Shuang Huang, Chun-Hou Zheng, Li S...
87
Voted
ICCS
2004
Springer
15 years 6 months ago
Parallel Importance Separation for Multiple Integrals and Integral Equations
In this paper we present error and performance analysis of a Monte Carlo variance reduction method for solving multidimensional integrals and integral equations. This method, calle...
Sofiya Ivanovska, Aneta Karaivanova