{"id":"W2122196799","doi":"10.1109/cvpr.2012.6248043","title":"Fast search in Hamming space with multi-index hashing","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":266,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hash function; Hamming space; Hamming distance; Hamming code; Computer science; Substring; Linear code; Hash table; Binary code; Dynamic perfect hashing; Perfect hash function; Algorithm; Theoretical computer science; Binary number; Bit array; Hamming(7,4); Code (set theory); Data structure; Block code; Double hashing; Mathematics; Arithmetic; Decoding methods","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003609656,0.000104606,0.0001104813,0.0001287969,0.00006281373,0.00009958883,0.0003977107,0.00003745054,0.000009777959],"category_scores_gemma":[0.00002928449,0.00007845788,0.00001915422,0.0004892771,0.00003151494,0.001930257,0.0002277917,0.0002009049,0.00002573611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005241134,"about_ca_system_score_gemma":0.00002703874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000104491,"about_ca_topic_score_gemma":0.00004730455,"domain_scores_codex":[0.9989845,0.00003405112,0.0001102739,0.0002156891,0.0002132367,0.000442213],"domain_scores_gemma":[0.9994476,0.00005831852,0.00002592566,0.0003237162,0.00004264394,0.0001017404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003471702,0.000404152,0.3919584,0.00004651037,0.00001581872,0.00008938874,0.006446618,0.0002638685,0.01143067,0.04079473,0.000279056,0.5482361],"study_design_scores_gemma":[0.001794955,0.0003144339,0.1033966,0.0002458474,0.000004548072,0.0001219081,0.001207116,0.1157661,0.7644141,0.0006361804,0.01093473,0.001163445],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00843255,0.00009777947,0.9880291,0.0002959754,0.00003366399,0.0001320938,1.268004e-7,0.0002663413,0.002712397],"genre_scores_gemma":[0.593012,0.000006770216,0.4061453,0.0001135447,0.00002124731,0.000004320116,1.568569e-7,0.000006109741,0.0006905667],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7529835,"threshold_uncertainty_score":0.319942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03193554309429394,"score_gpt":0.3080545919139152,"score_spread":0.2761190488196212,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}