Carregant...
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...
Guardat en:
| Publicat a: | IEEE Trans Inf Theory |
|---|---|
| Autors principals: | , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2016
|
| Matèries: | |
| Accés en línia: | 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 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|