The MM-tree: a memory-based metric tree without overlap between nodes (2007)
Source: Lecture Notes in Computer Science. Conference titles: East European Conference - ADBIS 2007. Unidade: ICMC
Subjects: COMPUTAÇÃO GRÁFICA, PROCESSAMENTO DE IMAGENS
ABNT
POLA, Ives Renê Venturini e TRAINA JUNIOR, Caetano e TRAINA, Agma Juci Machado. The MM-tree: a memory-based metric tree without overlap between nodes. Lecture Notes in Computer Science. Berlin: Springer. Disponível em: http://www.springerlink.com/content/08138jn40q715113/fulltext.pdf. Acesso em: 06 nov. 2025. , 2007APA
Pola, I. R. V., Traina Junior, C., & Traina, A. J. M. (2007). The MM-tree: a memory-based metric tree without overlap between nodes. Lecture Notes in Computer Science. Berlin: Springer. Recuperado de http://www.springerlink.com/content/08138jn40q715113/fulltext.pdfNLM
Pola IRV, Traina Junior C, Traina AJM. The MM-tree: a memory-based metric tree without overlap between nodes [Internet]. Lecture Notes in Computer Science. 2007 ; 4690 157-171.[citado 2025 nov. 06 ] Available from: http://www.springerlink.com/content/08138jn40q715113/fulltext.pdfVancouver
Pola IRV, Traina Junior C, Traina AJM. The MM-tree: a memory-based metric tree without overlap between nodes [Internet]. Lecture Notes in Computer Science. 2007 ; 4690 157-171.[citado 2025 nov. 06 ] Available from: http://www.springerlink.com/content/08138jn40q715113/fulltext.pdf
