Last Updated：2025/12/03
Sentence
高次元空間での最近傍探索を最適化する際、k次元木はしばしば総当たり探索よりも優れた性能を示します。
Quizzes for review
When optimizing nearest-neighbor queries in high-dimensional spaces, k-d trees often outperform brute-force search.
See correct answer
When optimizing nearest-neighbor queries in high-dimensional spaces, k-d trees often outperform brute-force search.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
