Yüklüyor......
Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes
We study the problem of compression for the purpose of similarity identification, where similarity is measured by the mean square Euclidean distance between vectors. While the asymptotical fundamental limits of the problem – the minimal compression rate and the error exponent – were found in a previ...
Kaydedildi:
| Yayımlandı: | IEEE Trans Inf Theory |
|---|---|
| Asıl Yazarlar: | , , , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
2016
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5796586/ https://ncbi.nlm.nih.gov/pubmed/29398721 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/TIT.2016.2535172 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|