z-logo
open-access-imgOpen Access
Ordinal Constrained Binary Code Learning for Nearest Neighbor Search
Author(s) -
Hong Liu,
Rongrong Ji,
Yongjian Wu,
Feiyue Huang
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.10906
Subject(s) - universal hashing , binary code , k independent hashing , locality sensitive hashing , computer science , hash function , ordinal data , nearest neighbor search , theoretical computer science , ranking (information retrieval) , hash table , ranking svm , hamming distance , dynamic perfect hashing , artificial intelligence , tuple , mathematics , binary number , machine learning , algorithm , double hashing , discrete mathematics , computer security , arithmetic

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom