Filtros : "graphs" Limpar

Filtros



Refine with date range


  • Source: Proceedings. Conference titles: International Conference on Data Mining Workshops - ICDMW. Unidade: ICMC

    Subjects: BANCO DE DADOS, COMPUTAÇÃO GRÁFICA

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

      GIMENES, Gabriel P e GUALDRON, Hugo e RODRIGUES JUNIOR, José Fernando. Vertex centric asynchronous belief propagation algorithm for large-scale graphs. 2016, Anais.. Los Alamitos: IEEE, 2016. Disponível em: https://doi.org/10.1109/ICDMW.2016.0021. Acesso em: 19 abr. 2024.
    • APA

      Gimenes, G. P., Gualdron, H., & Rodrigues Junior, J. F. (2016). Vertex centric asynchronous belief propagation algorithm for large-scale graphs. In Proceedings. Los Alamitos: IEEE. doi:10.1109/ICDMW.2016.0021
    • NLM

      Gimenes GP, Gualdron H, Rodrigues Junior JF. Vertex centric asynchronous belief propagation algorithm for large-scale graphs [Internet]. Proceedings. 2016 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1109/ICDMW.2016.0021
    • Vancouver

      Gimenes GP, Gualdron H, Rodrigues Junior JF. Vertex centric asynchronous belief propagation algorithm for large-scale graphs [Internet]. Proceedings. 2016 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1109/ICDMW.2016.0021
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

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

      BOTLER, Fábio Happ et al. Decompositions of highly connected graphs into paths of length five. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.036. Acesso em: 19 abr. 2024. , 2015
    • APA

      Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Decompositions of highly connected graphs into paths of length five. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.036
    • NLM

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
    • Vancouver

      Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of length five [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 211-216.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2015.07.036
  • Source: Electronic Notes in Discrete Mathematics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME

    Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA

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

      BOTLER, F et al. Decompositions of highly connected graphs into paths of any given length. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.06.107. Acesso em: 19 abr. 2024. , 2015
    • APA

      Botler, F., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2015). Decompositions of highly connected graphs into paths of any given length. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.06.107
    • NLM

      Botler F, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of any given length [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
    • Vancouver

      Botler F, Mota GO, Oshiro MTI, Wakabayashi Y. Decompositions of highly connected graphs into paths of any given length [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; No 2015[citado 2024 abr. 19 ] Available from: https://doi.org/10.1016/j.endm.2015.06.107
  • Source: Proceedings. Conference titles: International Conference on e-Science. Unidade: IME

    Subjects: VISÃO COMPUTACIONAL, RECONHECIMENTO DE PADRÕES, TEORIA DOS GRAFOS

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

      LEANDRO, Jorge de Jesus Gomes e CÉSAR JÚNIOR, Roberto Marcondes e FERIS, Rogério Schmidt. Shape analysis using the spectral graph wavelet transform. 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/eScience.2013.45. Acesso em: 19 abr. 2024.
    • APA

      Leandro, J. de J. G., César Júnior, R. M., & Feris, R. S. (2013). Shape analysis using the spectral graph wavelet transform. In Proceedings. Piscataway: IEEE. doi:10.1109/eScience.2013.45
    • NLM

      Leandro J de JG, César Júnior RM, Feris RS. Shape analysis using the spectral graph wavelet transform [Internet]. Proceedings. 2013 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1109/eScience.2013.45
    • Vancouver

      Leandro J de JG, César Júnior RM, Feris RS. Shape analysis using the spectral graph wavelet transform [Internet]. Proceedings. 2013 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1109/eScience.2013.45
  • Source: Annals of Applied Probability. Unidade: IME

    Assunto: PROCESSOS ESTOCÁSTICOS ESPECIAIS

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

      SCHONMANN, Roberto Henrique e TANAKA, Nelson Ithiro. Lack of monotonicity in ferromagnetic ising model phase diagrams. Annals of Applied Probability, v. 8, n. 1, p. 113-130, 1998Tradução . . Disponível em: https://doi.org/10.1214/aoap/1027961042. Acesso em: 19 abr. 2024.
    • APA

      Schonmann, R. H., & Tanaka, N. I. (1998). Lack of monotonicity in ferromagnetic ising model phase diagrams. Annals of Applied Probability, 8( 1), 113-130. doi:10.1214/aoap/1027961042
    • NLM

      Schonmann RH, Tanaka NI. Lack of monotonicity in ferromagnetic ising model phase diagrams [Internet]. Annals of Applied Probability. 1998 ; 8( 1): 113-130.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1214/aoap/1027961042
    • Vancouver

      Schonmann RH, Tanaka NI. Lack of monotonicity in ferromagnetic ising model phase diagrams [Internet]. Annals of Applied Probability. 1998 ; 8( 1): 113-130.[citado 2024 abr. 19 ] Available from: https://doi.org/10.1214/aoap/1027961042

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