ReP USP - Resultado da busca

Artigo de periodico
Optimal Boolean lattice-based algorithms for the U-curve optimization problem (2019)
Reis, Marcelo da Silva ; Estrela, Gustavo; Ferreira, Carlos Eduardo ; Barrera, Junior
Fonte: Information Sciences. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REIS, Marcelo da Silva et al. Optimal Boolean lattice-based algorithms for the U-curve optimization problem. Information Sciences, v. 471, p. 97-114, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ins.2018.08.060. Acesso em: 30 set. 2024.
APA
Reis, M. da S., Estrela, G., Ferreira, C. E., & Barrera, J. (2019). Optimal Boolean lattice-based algorithms for the U-curve optimization problem. Information Sciences, 471, 97-114. doi:10.1016/j.ins.2018.08.060
NLM
Reis M da S, Estrela G, Ferreira CE, Barrera J. Optimal Boolean lattice-based algorithms for the U-curve optimization problem [Internet]. Information Sciences. 2019 ; 471 97-114.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.ins.2018.08.060
Vancouver
Reis M da S, Estrela G, Ferreira CE, Barrera J. Optimal Boolean lattice-based algorithms for the U-curve optimization problem [Internet]. Information Sciences. 2019 ; 471 97-114.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.ins.2018.08.060
Trabalho de evento
Solving problems in mathematical morphology through reductions to the U-Curve problem (2013)
Reis, Marcelo da Silva ; Barrera, Júnior
Fonte: Mathematical morphology and its applications to signal and image processing: proceedings. Nome do evento: International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing -ISMM. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REIS, Marcelo da Silva e BARRERA, Júnior. Solving problems in mathematical morphology through reductions to the U-Curve problem. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-38294-9_5. Acesso em: 30 set. 2024.
APA
Reis, M. da S., & Barrera, J. (2013). Solving problems in mathematical morphology through reductions to the U-Curve problem. In Mathematical morphology and its applications to signal and image processing: proceedings. Berlin: Springer. doi:10.1007/978-3-642-38294-9_5
NLM
Reis M da S, Barrera J. Solving problems in mathematical morphology through reductions to the U-Curve problem [Internet]. Mathematical morphology and its applications to signal and image processing: proceedings. 2013 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/978-3-642-38294-9_5
Vancouver
Reis M da S, Barrera J. Solving problems in mathematical morphology through reductions to the U-Curve problem [Internet]. Mathematical morphology and its applications to signal and image processing: proceedings. 2013 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/978-3-642-38294-9_5
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: 30 set. 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 set. 30 ] 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 set. 30 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018
Trabalho de evento
Design of statistically optimal stack filters (1999)
Hirata, Nina Sumiko Tomita ; Barrera, Júnior; Dougherty, Edward Russell
Fonte: Proceedings. Nome do evento: Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens - SIBGRAPI. Unidade: IME
Assuntos: PROCESSAMENTO DE IMAGENS, OTIMIZAÇÃO COMBINATÓRIA, ANÁLISE ESTATÍSTICA DE DADOS
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 e DOUGHERTY, Edward Russell. Design of statistically optimal stack filters. 1999, Anais.. Los Alamitos: IEEE, 1999. Disponível em: https://doi.org/10.1109/SIBGRA.1999.805734. Acesso em: 30 set. 2024.
APA
Hirata, N. S. T., Barrera, J., & Dougherty, E. R. (1999). Design of statistically optimal stack filters. In Proceedings. Los Alamitos: IEEE. doi:10.1109/SIBGRA.1999.805734
NLM
Hirata NST, Barrera J, Dougherty ER. Design of statistically optimal stack filters [Internet]. Proceedings. 1999 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1109/SIBGRA.1999.805734
Vancouver
Hirata NST, Barrera J, Dougherty ER. Design of statistically optimal stack filters [Internet]. Proceedings. 1999 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1109/SIBGRA.1999.805734
Relatorio tecnico
A combinatorial optimization technique for the sequential decomposition of erosions and dilations (1999)
Hashimoto, Ronaldo Fumio ; Barrera, Junior ; Ferreira, Carlos Eduardo
Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, PROCESSAMENTO DE IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HASHIMOTO, Ronaldo Fumio e BARRERA, Junior e FERREIRA, Carlos Eduardo. A combinatorial optimization technique for the sequential decomposition of erosions and dilations. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/51855934-4914-478b-8818-288b5e94a2b0/1036396.pdf. Acesso em: 30 set. 2024. , 1999
APA
Hashimoto, R. F., Barrera, J., & Ferreira, C. E. (1999). A combinatorial optimization technique for the sequential decomposition of erosions and dilations. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/51855934-4914-478b-8818-288b5e94a2b0/1036396.pdf
NLM
Hashimoto RF, Barrera J, Ferreira CE. A combinatorial optimization technique for the sequential decomposition of erosions and dilations [Internet]. 1999 ;[citado 2024 set. 30 ] Available from: https://repositorio.usp.br/directbitstream/51855934-4914-478b-8818-288b5e94a2b0/1036396.pdf
Vancouver
Hashimoto RF, Barrera J, Ferreira CE. A combinatorial optimization technique for the sequential decomposition of erosions and dilations [Internet]. 1999 ;[citado 2024 set. 30 ] Available from: https://repositorio.usp.br/directbitstream/51855934-4914-478b-8818-288b5e94a2b0/1036396.pdf

Unidades USP

ReP

Filtros

Autores

Indexado em