Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
INTERSPEECH
2010
11 years 11 days ago
What else is new than the hamming window? robust MFCCs for speaker recognition via multitapering
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...
Tomi Kinnunen, Rahim Saeidi, Johan Sandberg, Maria...
VLDB
2002
ACM
137views Database» more  VLDB 2002»
11 years 5 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
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...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
TIT
2002
129views more  TIT 2002»
11 years 5 months ago
Combinatorial bounds for list decoding
Abstract--Informally, an error-correcting code has "nice" listdecodability properties if every Hamming ball of "large" radius has a "small" number of ...
Venkatesan Guruswami, Johan Håstad, Madhu Su...
ENDM
2007
100views more  ENDM 2007»
11 years 5 months ago
Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
Sanming Zhou
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
11 years 10 months ago
Approximation Algorithms for Hamming Clustering Problems
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...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
books