Filtros : "IFSC225" "International Journal of Modern Physics C" Removidos: "Angelo, Claudio Felisoni de" "1914" "Physical Review E" Limpar

Filtros



Refine with date range


  • Source: International Journal of Modern Physics C. Unidade: IFSC

    Subjects: RECONHECIMENTO DE PADRÕES, PROCESSAMENTO DE IMAGENS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MACHICAO, Jeaneth et al. Exploiting ergodicity of the logistic map using deep-zoom to improve security of chaos-based cryptosystems. International Journal of Modern Physics C, v. 30, n. 4, p. 1950033-1-1950033-18, 2019Tradução . . Disponível em: https://doi.org/10.1142/S0129183119500335. Acesso em: 11 nov. 2024.
    • APA

      Machicao, J., Alves, M., Baptista, M. S., & Bruno, O. M. (2019). Exploiting ergodicity of the logistic map using deep-zoom to improve security of chaos-based cryptosystems. International Journal of Modern Physics C, 30( 4), 1950033-1-1950033-18. doi:10.1142/S0129183119500335
    • NLM

      Machicao J, Alves M, Baptista MS, Bruno OM. Exploiting ergodicity of the logistic map using deep-zoom to improve security of chaos-based cryptosystems [Internet]. International Journal of Modern Physics C. 2019 ; 30( 4): 1950033-1-1950033-18.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183119500335
    • Vancouver

      Machicao J, Alves M, Baptista MS, Bruno OM. Exploiting ergodicity of the logistic map using deep-zoom to improve security of chaos-based cryptosystems [Internet]. International Journal of Modern Physics C. 2019 ; 30( 4): 1950033-1-1950033-18.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183119500335
  • Source: International Journal of Modern Physics C. Unidade: IFSC

    Subjects: RECONHECIMENTO DE PADRÕES, PROCESSAMENTO DE IMAGENS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BARROS NEIVA, Mariane e GUIDOTTI, Patrick e BRUNO, Odemir Martinez. Enhancing LBP by preprocessing via anisotropic diffusion. International Journal of Modern Physics C, v. 29, n. 8, p. 1850071-1-1850071-29, 2018Tradução . . Disponível em: https://doi.org/10.1142/S0129183118500717. Acesso em: 11 nov. 2024.
    • APA

      Barros Neiva, M., Guidotti, P., & Bruno, O. M. (2018). Enhancing LBP by preprocessing via anisotropic diffusion. International Journal of Modern Physics C, 29( 8), 1850071-1-1850071-29. doi:10.1142/S0129183118500717
    • NLM

      Barros Neiva M, Guidotti P, Bruno OM. Enhancing LBP by preprocessing via anisotropic diffusion [Internet]. International Journal of Modern Physics C. 2018 ; 29( 8): 1850071-1-1850071-29.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183118500717
    • Vancouver

      Barros Neiva M, Guidotti P, Bruno OM. Enhancing LBP by preprocessing via anisotropic diffusion [Internet]. International Journal of Modern Physics C. 2018 ; 29( 8): 1850071-1-1850071-29.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183118500717
  • Source: International Journal of Modern Physics C. Unidade: IFSC

    Subjects: REDES COMPLEXAS, REDES DE COMPUTADORES, CIÊNCIA DA COMPUTAÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BACKES, André Ricardo e CASANOVA, Dalcimar e BRUNO, Odemir Martinez. Contour polygonal approximation using the shortest path in networks. International Journal of Modern Physics C, v. 25, n. 2, p. 1350090-1-1350090-23, 2014Tradução . . Disponível em: https://doi.org/10.1142/S0129183113500903. Acesso em: 11 nov. 2024.
    • APA

      Backes, A. R., Casanova, D., & Bruno, O. M. (2014). Contour polygonal approximation using the shortest path in networks. International Journal of Modern Physics C, 25( 2), 1350090-1-1350090-23. doi:10.1142/S0129183113500903
    • NLM

      Backes AR, Casanova D, Bruno OM. Contour polygonal approximation using the shortest path in networks [Internet]. International Journal of Modern Physics C. 2014 ; 25( 2): 1350090-1-1350090-23.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183113500903
    • Vancouver

      Backes AR, Casanova D, Bruno OM. Contour polygonal approximation using the shortest path in networks [Internet]. International Journal of Modern Physics C. 2014 ; 25( 2): 1350090-1-1350090-23.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183113500903
  • Source: International Journal of Modern Physics C. Unidades: ICMC, IFSC

    Subjects: FRACTAIS (ANÁLISE), PROCESSAMENTO DE IMAGENS, REDES COMPLEXAS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FLORINDO, João Batista e CASTRO, Mário de e BRUNO, Odemir Martinez. Enhancing volumetric Bouligand-Minkowski fractal descriptors by using functional data analysis. International Journal of Modern Physics C, v. 22, n. 9, p. 929-952, 2011Tradução . . Disponível em: https://doi.org/10.1142/S0129183111016701. Acesso em: 11 nov. 2024.
    • APA

      Florindo, J. B., Castro, M. de, & Bruno, O. M. (2011). Enhancing volumetric Bouligand-Minkowski fractal descriptors by using functional data analysis. International Journal of Modern Physics C, 22( 9), 929-952. doi:10.1142/S0129183111016701
    • NLM

      Florindo JB, Castro M de, Bruno OM. Enhancing volumetric Bouligand-Minkowski fractal descriptors by using functional data analysis [Internet]. International Journal of Modern Physics C. 2011 ; 22( 9): 929-952.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183111016701
    • Vancouver

      Florindo JB, Castro M de, Bruno OM. Enhancing volumetric Bouligand-Minkowski fractal descriptors by using functional data analysis [Internet]. International Journal of Modern Physics C. 2011 ; 22( 9): 929-952.[citado 2024 nov. 11 ] Available from: https://doi.org/10.1142/S0129183111016701

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024