资源分类
》 资源 》论文》The Power of Asymmetry in Binary Hashing

The Power of Asymmetry in Binary Hashing

2020-01-16 | |  289 |   79 |   0

Abstract

When approximating binary similarity using the hamming distance between short binary hashes, we show that even if the similarity is symmetric, we can have shorter and more accurate hashes by using two distinct code maps. I.e. by approximating the similarity between x and x0 as the hamming distance between f 图片.png for two distinct binary codes 图片.png rather than as the hamming distance between 图片.png

上一篇：Stochastic Majorization-Minimization Algorithms for Large-Scale Optimization

下一篇：Multisensory Encoding, Decoding, and Identification

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...