• Aucun résultat trouvé

Searching in one billion vectors: re-rank with source coding

N/A
N/A
Protected

Academic year: 2021

Partager "Searching in one billion vectors: re-rank with source coding"

Copied!
5
0
0

Texte intégral

Références

Documents relatifs

a Aix-Marseille Université, CNRS, CINaM UMR 7325, 163 avenue de Luminy, 13288 Marseille cedex 9, France b Aix-Marseille Université, INSERM, CRO2 UMR 911, 13385 Marseille cedex

We introduce a general probabilistic framework called coding-based ISS (CISS) that consists in quantizing the sources using some posterior source distribution from those usually used

Nous y d´ emontrons la per- tinence des deux mod` eles de sources binaires (non-uniforme et de GE), et des deux mod` eles de canal de corr´ elation (canal binaire sym´ etrique

This paper proposes to configure nanophotonics intercon- nects by jointly i) selecting the ECC used for data transmission and ii) tuning the laser output power. Hence, by considering

The last layer of HBF is rather independent of the training target and mostly depends on the input part of the training set (see theory and gradient.. descent equations in Poggio

Regarding articial redundancy, multiple description coding is used to introduce structured redundancy among source samples, while aiming to achieve a progressive improvement of

The information source under investigation falls into the class of AVCS because the decoder observes a sequence y n of side information correlated with x n. , x K ) and there is

However, since classical decoding algorithm require the knowledge of the true correlation channel, i.e., θ, we propose a practical scheme capable of dealing with the lack of