ReP USP - Resultado da busca

Artigo de periodico
A fast Branch-and-Bound algorithm for U-curve feature selection (2018)
Atashpaz-Gargari, Esmaeil; Reis, Marcelo da Silva ; Braga-Neto, Ulisses M.; Barrera, Júnior; Dougherty, Edward R
Fonte: Pattern Recognition. Unidade: IME
Assunto: CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ATASHPAZ-GARGARI, Esmaeil et al. A fast Branch-and-Bound algorithm for U-curve feature selection. Pattern Recognition, v. 73, p. 172-188, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2017.08.013. Acesso em: 11 nov. 2025.
APA
Atashpaz-Gargari, E., Reis, M. da S., Braga-Neto, U. M., Barrera, J., & Dougherty, E. R. (2018). A fast Branch-and-Bound algorithm for U-curve feature selection. Pattern Recognition, 73, 172-188. doi:10.1016/j.patcog.2017.08.013
NLM
Atashpaz-Gargari E, Reis M da S, Braga-Neto UM, Barrera J, Dougherty ER. A fast Branch-and-Bound algorithm for U-curve feature selection [Internet]. Pattern Recognition. 2018 ; 73 172-188.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2017.08.013
Vancouver
Atashpaz-Gargari E, Reis M da S, Braga-Neto UM, Barrera J, Dougherty ER. A fast Branch-and-Bound algorithm for U-curve feature selection [Internet]. Pattern Recognition. 2018 ; 73 172-188.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2017.08.013
Artigo de periodico
U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem (2010)
Ris, Marcelo; Barrera, Júnior; Martins Junior, David C.
Fonte: Pattern Recognition. Unidade: FFCLRP
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RIS, Marcelo e BARRERA, Júnior e MARTINS JUNIOR, David C. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. Pattern Recognition, v. 43, n. 3, p. 557-568, 2010Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2009.08.018. Acesso em: 11 nov. 2025.
APA
Ris, M., Barrera, J., & Martins Junior, D. C. (2010). U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. Pattern Recognition, 43( 3), 557-568. doi:10.1016/j.patcog.2009.08.018
NLM
Ris M, Barrera J, Martins Junior DC. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem [Internet]. Pattern Recognition. 2010 ; 43( 3): 557-568.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018
Vancouver
Ris M, Barrera J, Martins Junior DC. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem [Internet]. Pattern Recognition. 2010 ; 43( 3): 557-568.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018
Artigo de periodico
A unifying view for stack filter design based on graph search methods (2005)
Hirata, Nina Sumiko Tomita ; Barrera, Júnior
Fonte: Pattern Recognition. Unidade: IME
Assunto: COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HIRATA, Nina Sumiko Tomita e BARRERA, Júnior. A unifying view for stack filter design based on graph search methods. Pattern Recognition, v. 38, n. 11, p. 2088-2098, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2005.02.018. Acesso em: 11 nov. 2025.
APA
Hirata, N. S. T., & Barrera, J. (2005). A unifying view for stack filter design based on graph search methods. Pattern Recognition, 38( 11), 2088-2098. doi:10.1016/j.patcog.2005.02.018
NLM
Hirata NST, Barrera J. A unifying view for stack filter design based on graph search methods [Internet]. Pattern Recognition. 2005 ; 38( 11): 2088-2098.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2005.02.018
Vancouver
Hirata NST, Barrera J. A unifying view for stack filter design based on graph search methods [Internet]. Pattern Recognition. 2005 ; 38( 11): 2088-2098.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/j.patcog.2005.02.018
Artigo de periodico
A switching algorithm for design of optimal increasing binary filters over large windows (2000)
Hirata, Nina Sumiko Tomita ; Dougherty, Edward R; Barrera, Júnior
Fonte: Pattern Recognition. Unidade: IME
Assuntos: COMPUTAÇÃO GRÁFICA, VISÃO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HIRATA, Nina Sumiko Tomita e DOUGHERTY, Edward R e BARRERA, Júnior. A switching algorithm for design of optimal increasing binary filters over large windows. Pattern Recognition, v. 33, n. 6, p. 1059-1081, 2000Tradução . . Disponível em: https://doi.org/10.1016/S0031-3203(99)00165-X. Acesso em: 11 nov. 2025.
APA
Hirata, N. S. T., Dougherty, E. R., & Barrera, J. (2000). A switching algorithm for design of optimal increasing binary filters over large windows. Pattern Recognition, 33( 6), 1059-1081. doi:10.1016/S0031-3203(99)00165-X
NLM
Hirata NST, Dougherty ER, Barrera J. A switching algorithm for design of optimal increasing binary filters over large windows [Internet]. Pattern Recognition. 2000 ; 33( 6): 1059-1081.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/S0031-3203(99)00165-X
Vancouver
Hirata NST, Dougherty ER, Barrera J. A switching algorithm for design of optimal increasing binary filters over large windows [Internet]. Pattern Recognition. 2000 ; 33( 6): 1059-1081.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1016/S0031-3203(99)00165-X

Unidades USP

ReP

Filtros

Autores

Agência de fomento

Indexado em