List of clustered permutations in secondary memory for proximity searching
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 th...
Guardado en:
| Autores principales: | Roggero, Patricia, Reyes, Nora Susana, Figueroa, Karina, Paredes, Rodrigo |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/50184 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST41-Paper-10.pdf |
| Aporte de: |
Ejemplares similares
-
List of Clustered Permutations in Secondary Memory
por: Roggero, Patricia, et al.
Publicado: (2015) -
A hybrid approach to boost the permutation index for similarity searching
por: Figueroa, Karina, et al.
Publicado: (2022) -
Dynamic Spatial Approximation Trees with clusters for secondary memory
por: Britos, Luís, et al.
Publicado: (2010) -
Using parallel pivot vs. clustering-based techniques for web engines
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2007) -
An unbalanced approach to metric space searching
por: Chávez, Edgar, et al.
Publicado: (2005)