Home ›
Entities
› academia
› High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search
High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search
Research article (Journal of Parallel and Distributed Computing, 2019) · cited 16× · AI/ML
High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search
Summary
High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search is a scholarly article[1].
Key Facts
High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
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.
APA4ort.xyz Knowledge Graph. (2026). High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search. Retrieved May 24, 2026, from https://4ort.xyz/entity/high-dimensional-image-descriptor-matching-using-highly-parallel-kd-tree-construction-and-approximate-nearest-neighbor-s
MLA“High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/high-dimensional-image-descriptor-matching-using-highly-parallel-kd-tree-construction-and-approximate-nearest-neighbor-s.
BibTeX@misc{4ortxyz_high-dimensional-image-descriptor-matching-using-highly-parallel-kd-tree-construction-and-approximate-nearest-neighbor-s_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search}}, year = {2026}, url = {https://4ort.xyz/entity/high-dimensional-image-descriptor-matching-using-highly-parallel-kd-tree-construction-and-approximate-nearest-neighbor-s}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): High-dimensional image descriptor matching using highly parallel KD-tree construction and approximate nearest neighbor search — https://4ort.xyz/entity/high-dimensional-image-descriptor-matching-using-highly-parallel-kd-tree-construction-and-approximate-nearest-neighbor-s (retrieved 2026-05-24)
