Does anyone know/have any good K-D Tree implementation in C++/Java?
→ Обратите внимание
До соревнования
2023 Post World Finals Online ICPC Challenge powered by Huawei
04:38:13
Зарегистрироваться »
2023 Post World Finals Online ICPC Challenge powered by Huawei
04:38:13
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 06.05.2024 13:21:47 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
I'm sorry that I cannot help you...
But I wonder is this K-D Tree just the data structure that is used in Machine Learning? I remember that there is a classification algorithm which is referred to as K-nearest neighbors, and K-D Tree is used for data preprocessing.
Yes, K-D tree is the data structure used for KNN method in ML. Also K-D tree is helpful in databases for performing queries with multidimensional search key.
StanfordACM