Sciweavers

1717 search results - page 33 / 344
» A Computable Spectral Theorem
Sort
View
106
Voted
ICMCS
2005
IEEE
145views Multimedia» more  ICMCS 2005»
15 years 9 months ago
Gaussian Mixture Modeling Using Short Time Fourier Transform Features for Audio Fingerprinting
In audio fingerprinting, an audio clip must be recognized by matching an extracted fingerprint to a database of previously computed fingerprints. The fingerprints should reduc...
Arunan Ramalingam, Sridhar Krishnan
113
Voted
AUSAI
2009
Springer
15 years 7 months ago
Adapting Spectral Co-clustering to Documents and Terms Using Latent Semantic Analysis
Abstract. Spectral co-clustering is a generic method of computing coclusters of relational data, such as sets of documents and their terms. Latent semantic analysis is a method of ...
Laurence A. F. Park, Christopher Leckie, Kotagiri ...
TWC
2008
86views more  TWC 2008»
15 years 3 months ago
On the Spectral Efficiency of CDMA Downlink Cellular Mobile Networks
A new accurate mathematical analysis is presented for the efficient computation of the spectral efficiency of CDMA downlink wireless communication systems in the presence of multip...
Khairi Ashour Hamdi, Pongsatorn Sedtheetorn
136
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Cross-Channel Spectral Subtraction for meeting speech recognition
We propose Cross-Channel Spectral Subtraction (CCSS), a source separation method for recognizing meeting speech where one microphone is prepared for each speaker. The method quick...
Yu Nasu, Koichi Shinoda, Sadaoki Furui
127
Voted
JUCS
2007
88views more  JUCS 2007»
15 years 3 months ago
A Comparison of Various Methods for Computing Bounds for Positive Roots of Polynomials
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
Alkiviadis G. Akritas, Panagiotis S. Vigklas