Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

Performance bounds for nearest neighbor search with k-d trees

Saved in:
Bibliographic Details
Published in:ArXiv cs.DS Recent Papers
Format: Online Article RSS Article
Published: 2026
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1865127356389130240
collection WordPress RSS
FRELIP Feed Integration
container_title ArXiv cs.DS Recent Papers
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:51424
institution FRELIP
journal_source_facet ArXiv cs.DS Recent Papers
publishDate 2026
publishDateSort 2026
record_format rss_article
spellingShingle Performance bounds for nearest neighbor search with k-d trees
ArXiv cs.DS Recent Papers
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display ArXiv cs.DS Recent Papers
Computer Science & IT
Engineering & Technology
ArXiv cs.DS Recent Papers
Computer Science & IT
Engineering & Technology
subject_facet ArXiv cs.DS Recent Papers
Computer Science & IT
Engineering & Technology
title Performance bounds for nearest neighbor search with k-d trees
title_auth Performance bounds for nearest neighbor search with k-d trees
title_full Performance bounds for nearest neighbor search with k-d trees
title_fullStr Performance bounds for nearest neighbor search with k-d trees
title_full_unstemmed Performance bounds for nearest neighbor search with k-d trees
title_short Performance bounds for nearest neighbor search with k-d trees
title_sort performance bounds for nearest neighbor search with k-d trees
topic ArXiv cs.DS Recent Papers
Computer Science & IT
Engineering & Technology
url https://arxiv.org/abs/2605.11313v1