A carregar...

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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Publicado no:IEEE Trans Inf Theory
Main Authors: Steiner, Fabian, Dempfle, Steffen, Ingber, Amir, Weissman, Tsachy
Formato: Artigo
Idioma:Inglês
Publicado em: 2016
Assuntos:
Acesso em linha: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
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!