Birkbeck Institutional Research Online
metadata only
Long-tail hashing
Hashing, which represents data items as compact binary codes, has been becoming a more and more popular technique, e.g., for large-scale image retrieval, owing to its super fast search speed as well as its extremely economical memory consumption. However, existing hashing methods all try to learn bi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One#1144200
- MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One#1136775
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#986200
- Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors#1079303
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
Record · ID 1043938
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive