INTERSPEECH
2010
12 years 11 months ago
2010
Usually the mel-frequency cepstral coefficients (MFCCs) are derived via Hamming windowed DFT spectrum. In this paper, we advocate to use a so-called multitaper method instead. Mul...
VLDB
2002
ACM
13 years 4 months ago
2002
ACM
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
TIT
2002
13 years 4 months ago
2002
Abstract--Informally, an error-correcting code has "nice" listdecodability properties if every Hamming ball of "large" radius has a "small" number of ...
ENDM
2007
13 years 4 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
CPM
2000
Springer
13 years 9 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...