Home › Entities › academia › Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search

Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search

Research article (Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018) · cited 44× · AI/ML
academia openalex:W2808891190
Press Enter · cited answer in seconds

Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search

Summary

Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search is a scholarly article[1].

Key Facts

  • Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search. Retrieved May 24, 2026, from https://4ort.xyz/entity/accurate-and-fast-asymmetric-locality-sensitive-hashing-scheme-for-maximum-inner-product-search
MLA “Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/accurate-and-fast-asymmetric-locality-sensitive-hashing-scheme-for-maximum-inner-product-search.
BibTeX @misc{4ortxyz_accurate-and-fast-asymmetric-locality-sensitive-hashing-scheme-for-maximum-inner-product-search_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search}}, year = {2026}, url = {https://4ort.xyz/entity/accurate-and-fast-asymmetric-locality-sensitive-hashing-scheme-for-maximum-inner-product-search}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search — https://4ort.xyz/entity/accurate-and-fast-asymmetric-locality-sensitive-hashing-scheme-for-maximum-inner-product-search (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/accurate-and-fast-asymmetric-locality-sensitive-hashing-scheme-for-maximum-inner-product-search · Last refreshed: