— 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...
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 ...
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...
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...
—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...