Sciweavers

999 search results - page 105 / 200
» Spectral simplex method
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
ICASSP
2009
IEEE
15 years 4 months ago
A blind speech enhancement algorithm for the suppression of late reverberation and noise
This paper proposes a new speech enhancement algorithm for the suppression of background noise and late reverberation without a priori knowledge. A generalized spectral weighting ...
Heinrich W. Löllmann, Peter Vary
ICASSP
2008
IEEE
15 years 4 months ago
Exploiting temporal change of pitch in formant estimation
This paper considers the problem of obtaining an accurate spectral representation of speech formant structure when the voicing source exhibits a high fundamental frequency. Our wo...
Tao T. Wang, Thomas F. Quatieri
GBRPR
2005
Springer
15 years 3 months ago
Towards Unitary Representations for Graph Matching
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
David Emms, Simone Severini, Richard C. Wilson, Ed...
GLOBECOM
2007
IEEE
14 years 11 months ago
Exploiting Single SISO Impulse Responses to Predict the Capacity of Correlated MIMO Channels
—A novel strategy of precalculating potential MIMO spectral efficiencies of correlated channels based on both, measured as well as appropriately modeled SISO channel impulse res...
Andreas Knopp, Christian A. Hofmann, Mohamed Choua...