Sciweavers

375 search results - page 25 / 75
» Accelerated spectral approximation
Sort
View
TIT
2002
101views more  TIT 2002»
13 years 7 months ago
Spectrally efficient noncoherent communication
This paper considers noncoherent communication over a frequency-nonselective channel in which the time-varying channel gain is unknown a priori, but is approximately constant over ...
Dilip Warrier, Upamanyu Madhow
MOC
2000
96views more  MOC 2000»
13 years 7 months ago
Galerkin eigenvector approximations
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
Christopher Beattie
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 9 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
ICASSP
2008
IEEE
14 years 2 months ago
Cepstral domain feature compensation based on diagonal approximation
In this paper, we propose a novel approach to feature compensation performed in the cepstral domain. We apply the linear approximation method in the cepstral domain to simplify th...
Woohyung Lim, Chang Woo Han, Jong Won Shin, Nam So...
AUTOMATICA
2011
12 years 11 months ago
A hierarchy of LMI inner approximations of the set of stable polynomials
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear ma...
Mustapha Ait Rami, Didier Henrion