ReP USP - Resultado da busca

Artigo de periodico
Using dynamical quantization to perform split attempts in online tree regressors (2021)
Mastelini, Saulo Martiello ; Carvalho, André Carlos Ponce de Leon Ferreira de
Source: Pattern Recognition Letters. Unidade: ICMC
Subjects: APRENDIZADO COMPUTACIONAL, ANÁLISE DE REGRESSÃO E DE CORRELAÇÃO, ALGORITMOS ÚTEIS E ESPECÍFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MASTELINI, Saulo Martiello e CARVALHO, André Carlos Ponce de Leon Ferreira de. Using dynamical quantization to perform split attempts in online tree regressors. Pattern Recognition Letters, v. 145, p. 37-42, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2021.01.033. Acesso em: 09 nov. 2025.
APA
Mastelini, S. M., & Carvalho, A. C. P. de L. F. de. (2021). Using dynamical quantization to perform split attempts in online tree regressors. Pattern Recognition Letters, 145, 37-42. doi:10.1016/j.patrec.2021.01.033
NLM
Mastelini SM, Carvalho ACP de LF de. Using dynamical quantization to perform split attempts in online tree regressors [Internet]. Pattern Recognition Letters. 2021 ; 145 37-42.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2021.01.033
Vancouver
Mastelini SM, Carvalho ACP de LF de. Using dynamical quantization to perform split attempts in online tree regressors [Internet]. Pattern Recognition Letters. 2021 ; 145 37-42.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2021.01.033
Artigo de periodico
Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts (2020)
Bejar, Hans H. C ; Guimaraes, Silvio Jamil Ferzoli ; Miranda, Paulo André Vechiatto de
Source: Pattern Recognition Letters. Unidade: IME
Subjects: INTERPOLAÇÃO, APROXIMAÇÃO POR POLINÔMIOS, CAD
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BEJAR, Hans H. C e GUIMARAES, Silvio Jamil Ferzoli e MIRANDA, Paulo André Vechiatto de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts. Pattern Recognition Letters, v. 131, p. 185-192, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.01.008. Acesso em: 09 nov. 2025.
APA
Bejar, H. H. C., Guimaraes, S. J. F., & Miranda, P. A. V. de. (2020). Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts. Pattern Recognition Letters, 131, 185-192. doi:10.1016/j.patrec.2020.01.008
NLM
Bejar HHC, Guimaraes SJF, Miranda PAV de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts [Internet]. Pattern Recognition Letters. 2020 ; 131 185-192.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.01.008
Vancouver
Bejar HHC, Guimaraes SJF, Miranda PAV de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts [Internet]. Pattern Recognition Letters. 2020 ; 131 185-192.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.01.008
Artigo de periodico
Quantifying the regularity of a 3D set of points on the surface of an ellipsoidal object (2020)
Comin, Cesar Henrique ; Taylor, Gavin J.; Costa, Luciano da Fontoura
Source: Pattern Recognition Letters. Unidade: IFSC
Subjects: REDES COMPLEXAS, TEORIA DA INFORMAÇÃO, VISÃO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COMIN, Cesar Henrique e TAYLOR, Gavin J. e COSTA, Luciano da Fontoura. Quantifying the regularity of a 3D set of points on the surface of an ellipsoidal object. Pattern Recognition Letters, v. 133, p. 1-7, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.02.012. Acesso em: 09 nov. 2025.
APA
Comin, C. H., Taylor, G. J., & Costa, L. da F. (2020). Quantifying the regularity of a 3D set of points on the surface of an ellipsoidal object. Pattern Recognition Letters, 133, 1-7. doi:10.1016/j.patrec.2020.02.012
NLM
Comin CH, Taylor GJ, Costa L da F. Quantifying the regularity of a 3D set of points on the surface of an ellipsoidal object [Internet]. Pattern Recognition Letters. 2020 ; 133 1-7.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.012
Vancouver
Comin CH, Taylor GJ, Costa L da F. Quantifying the regularity of a 3D set of points on the surface of an ellipsoidal object [Internet]. Pattern Recognition Letters. 2020 ; 133 1-7.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.012
Artigo de periodico
Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies (2020)
Alves, Wonder Alexandre Luz ; Gobber, Charles F; Silva, Dênnis José da; Morimitsu, Alexandre; Hashimoto, Ronaldo Fumio ; Marcotegui, Beatriz
Source: Pattern Recognition Letters. Unidade: IME
Subjects: INTERPOLAÇÃO, APROXIMAÇÃO POR POLINÔMIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Wonder Alexandre Luz et al. Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies. Pattern Recognition Letters, v. 133, p. 264-271, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.03.013. Acesso em: 09 nov. 2025.
APA
Alves, W. A. L., Gobber, C. F., Silva, D. J. da, Morimitsu, A., Hashimoto, R. F., & Marcotegui, B. (2020). Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies. Pattern Recognition Letters, 133, 264-271. doi:10.1016/j.patrec.2020.03.013
NLM
Alves WAL, Gobber CF, Silva DJ da, Morimitsu A, Hashimoto RF, Marcotegui B. Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies [Internet]. Pattern Recognition Letters. 2020 ; 133 264-271.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.03.013
Vancouver
Alves WAL, Gobber CF, Silva DJ da, Morimitsu A, Hashimoto RF, Marcotegui B. Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies [Internet]. Pattern Recognition Letters. 2020 ; 133 264-271.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.03.013
Artigo de periodico
A two-stage regularization framework for heterogeneous event networks (2020)
Santos, Brucce Neves dos ; Rossi, Rafael Geraldeli ; Rezende, Solange Oliveira ; Marcacini, Ricardo Marcondes
Source: Pattern Recognition Letters. Unidade: ICMC
Subjects: APRENDIZADO COMPUTACIONAL, RECONHECIMENTO DE PADRÕES, REDES SOCIAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTOS, Brucce Neves dos et al. A two-stage regularization framework for heterogeneous event networks. Pattern Recognition Letters, v. 138, p. 490-496, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.08.019. Acesso em: 09 nov. 2025.
APA
Santos, B. N. dos, Rossi, R. G., Rezende, S. O., & Marcacini, R. M. (2020). A two-stage regularization framework for heterogeneous event networks. Pattern Recognition Letters, 138, 490-496. doi:10.1016/j.patrec.2020.08.019
NLM
Santos BN dos, Rossi RG, Rezende SO, Marcacini RM. A two-stage regularization framework for heterogeneous event networks [Internet]. Pattern Recognition Letters. 2020 ; 138 490-496.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.08.019
Vancouver
Santos BN dos, Rossi RG, Rezende SO, Marcacini RM. A two-stage regularization framework for heterogeneous event networks [Internet]. Pattern Recognition Letters. 2020 ; 138 490-496.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.08.019
Artigo de periodico
Efficient component-hypertree construction based on hierarchy of partitions (2020)
Morimitsu, Alexandre; Passat, Nicolas ; Alves, Wonder Alexandre Luz ; Hashimoto, Ronaldo Fumio
Source: Pattern Recognition Letters. Unidade: IME
Subjects: PROCESSAMENTO DE IMAGENS, ALGORITMOS PARA IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MORIMITSU, Alexandre et al. Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recognition Letters, v. 135, p. 30-37, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.02.032. Acesso em: 09 nov. 2025.
APA
Morimitsu, A., Passat, N., Alves, W. A. L., & Hashimoto, R. F. (2020). Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recognition Letters, 135, 30-37. doi:10.1016/j.patrec.2020.02.032
NLM
Morimitsu A, Passat N, Alves WAL, Hashimoto RF. Efficient component-hypertree construction based on hierarchy of partitions [Internet]. Pattern Recognition Letters. 2020 ; 135 30-37.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.032
Vancouver
Morimitsu A, Passat N, Alves WAL, Hashimoto RF. Efficient component-hypertree construction based on hierarchy of partitions [Internet]. Pattern Recognition Letters. 2020 ; 135 30-37.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.032
Artigo de periodico
Incremental bit-quads count in component trees: theory, algorithms, and optimization (2020)
Silva, Dênnis José da; Alves, Wonder Alexandre Luz ; Hashimoto, Ronaldo Fumio
Source: Pattern Recognition Letters. Unidade: IME
Assunto: PROCESSAMENTO DE IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Dênnis José da e ALVES, Wonder Alexandre Luz e HASHIMOTO, Ronaldo Fumio. Incremental bit-quads count in component trees: theory, algorithms, and optimization. Pattern Recognition Letters, v. 129, p. 33-40, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2019.10.036. Acesso em: 09 nov. 2025.
APA
Silva, D. J. da, Alves, W. A. L., & Hashimoto, R. F. (2020). Incremental bit-quads count in component trees: theory, algorithms, and optimization. Pattern Recognition Letters, 129, 33-40. doi:10.1016/j.patrec.2019.10.036
NLM
Silva DJ da, Alves WAL, Hashimoto RF. Incremental bit-quads count in component trees: theory, algorithms, and optimization [Internet]. Pattern Recognition Letters. 2020 ; 129 33-40.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2019.10.036
Vancouver
Silva DJ da, Alves WAL, Hashimoto RF. Incremental bit-quads count in component trees: theory, algorithms, and optimization [Internet]. Pattern Recognition Letters. 2020 ; 129 33-40.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2019.10.036
Artigo de periodico
Scalable object instance recognition based on keygraph matching (2018)
Dazzi, Estephan; Campos, Teófilo de; Hilton, Adrian; César Júnior, Roberto Marcondes
Source: Pattern Recognition Letters. Unidade: IME
Subjects: INTERPOLAÇÃO, APROXIMAÇÃO POR POLINÔMIOS, GEOMETRIA COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DAZZI, Estephan et al. Scalable object instance recognition based on keygraph matching. Pattern Recognition Letters, v. 114, p. 53-62, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2017.10.038. Acesso em: 09 nov. 2025.
APA
Dazzi, E., Campos, T. de, Hilton, A., & César Júnior, R. M. (2018). Scalable object instance recognition based on keygraph matching. Pattern Recognition Letters, 114, 53-62. doi:10.1016/j.patrec.2017.10.038
NLM
Dazzi E, Campos T de, Hilton A, César Júnior RM. Scalable object instance recognition based on keygraph matching [Internet]. Pattern Recognition Letters. 2018 ; 114 53-62.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2017.10.038
Vancouver
Dazzi E, Campos T de, Hilton A, César Júnior RM. Scalable object instance recognition based on keygraph matching [Internet]. Pattern Recognition Letters. 2018 ; 114 53-62.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2017.10.038

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Funding Agencies

Non normalized affiliation