Načítá se...
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...
Uloženo v:
| Vydáno v: | IEEE Trans Inf Theory |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2016
|
| Témata: | |
| On-line přístup: | 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 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|