Efficient Computation of the <italic>K</italic> Nearest Neighbors Query Using Incremental Radius on a <italic>k</italic>²-tree
Proximity searches within metric spaces are critical for numerous real world applications, including pattern recognition, multimedia information retrieval, and spatial data analysis, among others. With the exponential increase in data volume, the demand for memory efficient structures to store and p...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
IEEE
2025-01-01
|
| Edice: | IEEE Access |
| Témata: | |
| On-line přístup: | https://ieeexplore.ieee.org/document/10975746/ |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|