Fully dynamic and memory-adaptative spatial approximation trees
Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in metric spaces, based on combining the concepts of spatial approximation and pivot based algorithms. These data structures are hybrid schemes, with the full features of dynamic spatial approximation tree...
Guardado en:
| Autores principales: | Arroyuelo, Diego, Navarro, Gonzalo, Reyes, Nora Susana |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2003
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/22852 |
| Aporte de: |
Ejemplares similares
-
An efficient alternative for deletions in dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2014) -
New deletion method for dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2013) -
An Efficient Dynamic Version of the Distal Spatial Approximation Trees
por: Chávez, Edgar, et al.
Publicado: (2022) -
Dynamic Spatial Approximation Trees with clusters for secondary memory
por: Britos, Luís, et al.
Publicado: (2010) -
Distal Dynamic Spatial Approximation Forest
por: Chávez, Edgar, et al.
Publicado: (2016)