Sciweavers

10051 search results - page 68 / 2011
» A Dynamic Separator Algorithm
Sort
View
TSP
2011
125views more  TSP 2011»
14 years 7 months ago
Weight Adjusted Tensor Method for Blind Separation of Underdetermined Mixtures of Nonstationary Sources
—In this paper, a novel algorithm to blindly separate an instantaneous linear underdetermined mixture of nonstationary sources is proposed. It means that the number of sources ex...
Petr Tichavský, Zbynek Koldovský
ICA
2004
Springer
15 years 6 months ago
A Geometric Approach for Separating Several Speech Signals
In this paper a new geometrical approach for separating speech signals is presented. This approach can be directly applied to separate more than two speech signals. It is based on ...
Massoud Babaie-Zadeh, Ali Mansour, Christian Jutte...
88
Voted
ESANN
2006
15 years 2 months ago
A simple idea to separate convolutive mixtures in an undetermined scenario
We consider a blind separation problem for undetermined mixtures of two BPSK signals in a multi-path fading channel. We use independence and frequency diversity of the two source s...
Maciej Pedzisz, Ali Mansour
93
Voted
ICASSP
2010
IEEE
15 years 23 days ago
A new method for kurtosis maximization and source separation
This paper introduces a new method to maximize kurtosisbased contrast functions. Such contrast functions appear in the problem of blind source separation of convolutively mixed so...
Marc Castella, Eric Moreau
101
Voted
TALG
2010
83views more  TALG 2010»
14 years 7 months ago
Finding shortest contractible and shortest separating cycles in embedded graphs
We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
Sergio Cabello