List of Clustered Permutations in Secondary Memory
Similarity search is a difficult problem and various indexing schemas have been defined to process similarity queries efficiently in many applications, including multimedia databases and other repositories handling complex objects. Metric indices support efficient similarity searches, but most of t...
Guardado en:
| Autores principales: | Roggero, Patricia, Reyes, Nora Susana, Figueroa, Karina, Paredes, Rodrigo |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/50446 |
| Aporte de: |
Ejemplares similares
-
List of clustered permutations in secondary memory for proximity searching
por: Roggero, Patricia, et al.
Publicado: (2015) -
Dynamic Spatial Approximation Trees with clusters for secondary memory
por: Britos, Luís, et al.
Publicado: (2010) -
A hybrid approach to boost the permutation index for similarity searching
por: Figueroa, Karina, et al.
Publicado: (2022) -
Fully dynamic and memory-adaptative spatial approximation trees
por: Arroyuelo, Diego, et al.
Publicado: (2003) -
Self-Clique Graphs and Matrix Permutations
por: Bondy, A., et al.