Sciweavers

1362 search results - page 15 / 273
» Means, Correlations and Bounds
Sort
View
TSP
2008
110views more  TSP 2008»
14 years 9 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
CORR
2006
Springer
127views Education» more  CORR 2006»
14 years 9 months ago
On the Peak-to-Mean Envelope Power Ratio of Phase-Shifted Binary Codes
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequencydivision multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rot...
Kai-Uwe Schmidt
ICASSP
2009
IEEE
15 years 4 months ago
TDOA estimation for cyclostationary sources: New correlations-based bounds and estimators
We consider the problem of Time Difference of Arrival (TDOA) estimation for cyclostationary signals in additive white Gaussian noise. Classical approaches to the problem either ig...
Moshe Teplitsky, Arie Yeredor
BIOCOMP
2006
14 years 11 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer