atlas

Research map / Architectures and efficiency / Neural architecture search

Improved Hamming Distance Search Using Variable Length Substrings

CVPR 2016 · Architectures and efficiency › Neural architecture search · approach: Differentiable architecture search (DARTS) · 30 citations (OpenAlex)

Check your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use variable-length hashkeys instead of MIH's fixed-length hashkeysThresholded Hamming search · ANN 1Baverage speedup over MIH: 30, 875, 784, 785Helped
Use variable-length hashkeys instead of MIH's fixed-length hashkeysThresholded Hamming search · 1 Million 128average speedup over MIH: 13, 818, 1359, 1064Helped
Use variable-length hashkeys instead of MIH's fixed-length hashkeysThresholded Hamming search · 1 Million 512average speedup over MIH: 18, 86, 98, 103Helped
Use variable-length hashkeys rather than fixed-length hashkeysThresholded Hamming search · Flickr 1 Million 512, Hamming thresholds between 100 and 150retrieval set sizeHurt
Use variable-length hashkeys rather than fixed-length hashkeysThresholded Hamming search · Across evaluated datasets and thresholdsminimum recall rateHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy