Efficient connected alternating sequential filters based on component trees (2025)
Fonte: Lecture Notes in Computer Science. Nome do evento: International Conference on Discrete Geometry and Mathematical Morphology - DGMM. Unidade: IME
Assuntos: ESTRUTURAS DE DADOS, OPERADORES E COMPILADORES, ALGORITMOS
ABNT
ALVES, Wonder Alexandre Luz et al. Efficient connected alternating sequential filters based on component trees. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-032-09544-2_15. Acesso em: 19 dez. 2025. , 2025APA
Alves, W. A. L., Passat, N., Silva, D. J. da, Morimitsu, A., & Hashimoto, R. F. (2025). Efficient connected alternating sequential filters based on component trees. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-032-09544-2_15NLM
Alves WAL, Passat N, Silva DJ da, Morimitsu A, Hashimoto RF. Efficient connected alternating sequential filters based on component trees [Internet]. Lecture Notes in Computer Science. 2025 ; 16296 210-223.[citado 2025 dez. 19 ] Available from: https://doi.org/10.1007/978-3-032-09544-2_15Vancouver
Alves WAL, Passat N, Silva DJ da, Morimitsu A, Hashimoto RF. Efficient connected alternating sequential filters based on component trees [Internet]. Lecture Notes in Computer Science. 2025 ; 16296 210-223.[citado 2025 dez. 19 ] Available from: https://doi.org/10.1007/978-3-032-09544-2_15
