"Sparse ternary codes for similarity search have higher coding gain than ..."

Sohrab Ferdowsi et al. (2017)

> Home

Details and statistics

DOI: 10.1109/ISIT.2017.8007010

access: closed

type: Conference or Workshop Paper

metadata version: 2024-03-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/FerdowsiVKH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/FerdowsiVKH17
Sohrab Ferdowsi, Slava Voloshynovskiy, Dimche Kostadinov, Taras Holotyak:
Sparse ternary codes for similarity search have higher coding gain than dense binary codes. ISIT 2017: 2653-2657

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.