1567 search results - page 108 / 314 » Compressing Relations and Indexes |
ICMCS
2009
IEEE
13 years 7 months ago
2009
IEEE
In this paper we present a text-independent automatic speaker verification system that works in the compressed domain using GSM AMR coded speech. While traditional approaches proc...
DCC
2009
IEEE
14 years 9 months ago
2009
IEEE
We present a new lossy compressor for discrete sources. For coding a source sequence xn , the encoder starts by assigning a certain cost to each reconstruction sequence. It then f...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
ICMCS
2009
IEEE
13 years 7 months ago
2009
IEEE
Peer-to-peer content distribution provides high network throughput with relatively low server cost and scales better than traditional content distribution networks with respect to...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...