ReP USP - Resultado da busca

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.
Source: 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: 16 abr. 2024.
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 2024 abr. 16 ] 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 2024 abr. 16 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018
Artigo de periodico
An exact algorithm for optimal MAE stack filter design (2007)
Dellamonica Junior, Domingos; Silva, Paulo J. S. ; Humes Júnior, Carlos; Hirata, Nina Sumiko Tomita ; Barrera, Júnior
Source: IEEE Transactions on image Processing. Unidade: IME
Assunto: PROCESSAMENTO DE IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. An exact algorithm for optimal MAE stack filter design. IEEE Transactions on image Processing, v. 16, n. 2, p. 453-462, 2007Tradução . . Disponível em: https://doi.org/10.1109/TIP.2006.888358. Acesso em: 16 abr. 2024.
APA
Dellamonica Junior, D., Silva, P. J. S., Humes Júnior, C., Hirata, N. S. T., & Barrera, J. (2007). An exact algorithm for optimal MAE stack filter design. IEEE Transactions on image Processing, 16( 2), 453-462. doi:10.1109/TIP.2006.888358
NLM
Dellamonica Junior D, Silva PJS, Humes Júnior C, Hirata NST, Barrera J. An exact algorithm for optimal MAE stack filter design [Internet]. IEEE Transactions on image Processing. 2007 ; 16( 2): 453-462.[citado 2024 abr. 16 ] Available from: https://doi.org/10.1109/TIP.2006.888358
Vancouver
Dellamonica Junior D, Silva PJS, Humes Júnior C, Hirata NST, Barrera J. An exact algorithm for optimal MAE stack filter design [Internet]. IEEE Transactions on image Processing. 2007 ; 16( 2): 453-462.[citado 2024 abr. 16 ] Available from: https://doi.org/10.1109/TIP.2006.888358
Artigo de periodico
A unifying view for stack filter design based on graph search methods (2005)
Hirata, Nina Sumiko Tomita ; Barrera, Júnior
Source: 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: 16 abr. 2024.
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 2024 abr. 16 ] 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 2024 abr. 16 ] 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
Source: Pattern Recognition. Unidade: IME
Subjects: 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: 16 abr. 2024.
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 2024 abr. 16 ] 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 2024 abr. 16 ] Available from: https://doi.org/10.1016/S0031-3203(99)00165-X
Trabalho de evento
Set operator decomposition and conditionally translation invariant elementary operators (1994)
Banon, G. J. F; Barrera, Júnior
Source: Proceedings. Conference titles: International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing. Unidade: IME
Assunto: MATEMÁTICA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BANON, G. J. F e BARRERA, Júnior. Set operator decomposition and conditionally translation invariant elementary operators. 1994, Anais.. Dordrecht: Kluwer, 1994. Disponível em: https://doi.org/10.1007/978-94-011-1040-2_2. Acesso em: 16 abr. 2024.
APA
Banon, G. J. F., & Barrera, J. (1994). Set operator decomposition and conditionally translation invariant elementary operators. In Proceedings. Dordrecht: Kluwer. doi:10.1007/978-94-011-1040-2_2
NLM
Banon GJF, Barrera J. Set operator decomposition and conditionally translation invariant elementary operators [Internet]. Proceedings. 1994 ;[citado 2024 abr. 16 ] Available from: https://doi.org/10.1007/978-94-011-1040-2_2
Vancouver
Banon GJF, Barrera J. Set operator decomposition and conditionally translation invariant elementary operators [Internet]. Proceedings. 1994 ;[citado 2024 abr. 16 ] Available from: https://doi.org/10.1007/978-94-011-1040-2_2

USP Schools

ReP

Filtros

Authors

Funding Agencies

Indexado em