Filtros : "Indexado no Scopus" "Financiamento NIH" Removidos: "Universität Würzburg (University of Würzburg)" "Hospital Israelita Albert Einstein. São Paulo, SP" "FFCLRP-594" "Suiça" "Financiado pelo CNPq." "ACVIM Forum" Limpar

Filtros



Refine with date range


  • Source: Journal of the Indian Society for Probability and Statistics. Unidades: ICMC, INTER: ICMC -UFSCAR

    Subjects: ANÁLISE DE SOBREVIVÊNCIA, NEOPLASIAS, VEROSSIMILHANÇA, PROCESSOS DE MARKOV

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

      BEDIA, Elizbeth Chipa e CANCHO, Vicente Garibay e BANDYOPADHYAY, Dipankar. A frailty model for semi-competing risk data with applications to colon cancer. Journal of the Indian Society for Probability and Statistics, v. 25, p. 395-416, 2024Tradução . . Disponível em: https://doi.org/10.1007/s41096-024-00186-9. Acesso em: 13 jul. 2024.
    • APA

      Bedia, E. C., Cancho, V. G., & Bandyopadhyay, D. (2024). A frailty model for semi-competing risk data with applications to colon cancer. Journal of the Indian Society for Probability and Statistics, 25, 395-416. doi:10.1007/s41096-024-00186-9
    • NLM

      Bedia EC, Cancho VG, Bandyopadhyay D. A frailty model for semi-competing risk data with applications to colon cancer [Internet]. Journal of the Indian Society for Probability and Statistics. 2024 ; 25 395-416.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1007/s41096-024-00186-9
    • Vancouver

      Bedia EC, Cancho VG, Bandyopadhyay D. A frailty model for semi-competing risk data with applications to colon cancer [Internet]. Journal of the Indian Society for Probability and Statistics. 2024 ; 25 395-416.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1007/s41096-024-00186-9
  • Source: Computational and Applied Mathematics. Unidade: ICMC

    Subjects: ALGORITMOS, TOPOLOGIA COMBINATÓRIA, ANÁLISE DE DESEMPENHO

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

      CASTELO, Antonio et al. A generalized combinatorial marching hypercube algorithm. Computational and Applied Mathematics, v. 43, p. 1-23, 2024Tradução . . Disponível em: https://doi.org/10.1007/s40314-024-02627-4. Acesso em: 13 jul. 2024.
    • APA

      Castelo, A., Nakassima, G. K., Bueno, L. M., & Gameiro, M. F. (2024). A generalized combinatorial marching hypercube algorithm. Computational and Applied Mathematics, 43, 1-23. doi:10.1007/s40314-024-02627-4
    • NLM

      Castelo A, Nakassima GK, Bueno LM, Gameiro MF. A generalized combinatorial marching hypercube algorithm [Internet]. Computational and Applied Mathematics. 2024 ; 43 1-23.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1007/s40314-024-02627-4
    • Vancouver

      Castelo A, Nakassima GK, Bueno LM, Gameiro MF. A generalized combinatorial marching hypercube algorithm [Internet]. Computational and Applied Mathematics. 2024 ; 43 1-23.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1007/s40314-024-02627-4
  • Source: Scientific Reports. Unidade: ICMC

    Subjects: FRACTAIS, PROCESSAMENTO DE SINAIS, CÉREBRO

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

      BOLLT, Erik et al. Fractal basins as a mechanism for the nimble brain. Scientific Reports, v. 13, p. 1-11, 2023Tradução . . Disponível em: https://doi.org/10.1038/s41598-023-45664-5. Acesso em: 13 jul. 2024.
    • APA

      Bollt, E., Fish, J., Kumar, A., Santos, E. S. dos, & Laurienti, P. J. (2023). Fractal basins as a mechanism for the nimble brain. Scientific Reports, 13, 1-11. doi:10.1038/s41598-023-45664-5
    • NLM

      Bollt E, Fish J, Kumar A, Santos ES dos, Laurienti PJ. Fractal basins as a mechanism for the nimble brain [Internet]. Scientific Reports. 2023 ; 13 1-11.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1038/s41598-023-45664-5
    • Vancouver

      Bollt E, Fish J, Kumar A, Santos ES dos, Laurienti PJ. Fractal basins as a mechanism for the nimble brain [Internet]. Scientific Reports. 2023 ; 13 1-11.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1038/s41598-023-45664-5
  • Source: Scientific Reports. Unidade: FMVZ

    Subjects: CARRAPATOS, MITOCÔNDRIAS, FILOGENIA, SEQUENCIAMENTO GENÉTICO

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

      KNEUBEHL, Alexander R et al. Amplification and sequencing of entire tick mitochondrial genomes for a phylogenomic analysis. Scientific Reports, v. 12, p. 1-13, 2022Tradução . . Disponível em: https://doi.org/10.1038/s41598-022-23393-5. Acesso em: 13 jul. 2024.
    • APA

      Kneubehl, A. R., Muñoz‑Leal, S., Filatov, S., Klerk, D. G. de, Pienaar, R., Lohmeyer, K. H., et al. (2022). Amplification and sequencing of entire tick mitochondrial genomes for a phylogenomic analysis. Scientific Reports, 12, 1-13. doi:10.1038/s41598-022-23393-5
    • NLM

      Kneubehl AR, Muñoz‑Leal S, Filatov S, Klerk DG de, Pienaar R, Lohmeyer KH, Bermúdez SE, Suriyamongkol T, Mali I, Kanduma E, Latif AA, Sarih M’hammed, Bouattour A, León AAP de, Teel PD, Labruna MB, Mans BJ, Lopez JE. Amplification and sequencing of entire tick mitochondrial genomes for a phylogenomic analysis [Internet]. Scientific Reports. 2022 ; 12 1-13.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1038/s41598-022-23393-5
    • Vancouver

      Kneubehl AR, Muñoz‑Leal S, Filatov S, Klerk DG de, Pienaar R, Lohmeyer KH, Bermúdez SE, Suriyamongkol T, Mali I, Kanduma E, Latif AA, Sarih M’hammed, Bouattour A, León AAP de, Teel PD, Labruna MB, Mans BJ, Lopez JE. Amplification and sequencing of entire tick mitochondrial genomes for a phylogenomic analysis [Internet]. Scientific Reports. 2022 ; 12 1-13.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1038/s41598-022-23393-5
  • Source: Applied Numerical Mathematics. Unidade: ICMC

    Subjects: PROBLEMAS DE CONTORNO, TEOREMAS LIMITES

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

      RAMOS, Eduardo e NOLASCO, Victor Hugo e GAMEIRO, Márcio Fuzeto. Rigorous enclosures of solutions of Neumann boundary value problems. Applied Numerical Mathematics, v. 180, p. 104-119, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.apnum.2022.05.011. Acesso em: 13 jul. 2024.
    • APA

      Ramos, E., Nolasco, V. H., & Gameiro, M. F. (2022). Rigorous enclosures of solutions of Neumann boundary value problems. Applied Numerical Mathematics, 180, 104-119. doi:10.1016/j.apnum.2022.05.011
    • NLM

      Ramos E, Nolasco VH, Gameiro MF. Rigorous enclosures of solutions of Neumann boundary value problems [Internet]. Applied Numerical Mathematics. 2022 ; 180 104-119.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.apnum.2022.05.011
    • Vancouver

      Ramos E, Nolasco VH, Gameiro MF. Rigorous enclosures of solutions of Neumann boundary value problems [Internet]. Applied Numerical Mathematics. 2022 ; 180 104-119.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.apnum.2022.05.011
  • Source: IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. Unidade: ICMC

    Subjects: PREVISÃO (ANÁLISE DE SÉRIES TEMPORAIS), APRENDIZADO COMPUTACIONAL, REDES NEURAIS, TEORIA DOS GRAFOS

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

      SPADON, Gabriel et al. Pay attention to evolution: time series forecasting with deep graph-evolution learning. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM, v. 44, n. 9, p. Se 2022, 2022Tradução . . Disponível em: https://doi.org/10.1109/TPAMI.2021.3076155. Acesso em: 13 jul. 2024.
    • APA

      Spadon, G., Hong, S., Machado, B. B., Matwin, S., Rodrigues Junior, J. F., & Sun, J. (2022). Pay attention to evolution: time series forecasting with deep graph-evolution learning. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM, 44( 9), Se 2022. doi:10.1109/TPAMI.2021.3076155
    • NLM

      Spadon G, Hong S, Machado BB, Matwin S, Rodrigues Junior JF, Sun J. Pay attention to evolution: time series forecasting with deep graph-evolution learning [Internet]. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. 2022 ; 44( 9): Se 2022.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1109/TPAMI.2021.3076155
    • Vancouver

      Spadon G, Hong S, Machado BB, Matwin S, Rodrigues Junior JF, Sun J. Pay attention to evolution: time series forecasting with deep graph-evolution learning [Internet]. IEEE Transactions on Pattern Analysis and Machine Intelligence - TPAM. 2022 ; 44( 9): Se 2022.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1109/TPAMI.2021.3076155
  • Source: Computers and Graphics. Unidade: ICMC

    Subjects: COMPUTAÇÃO GRÁFICA, ALGORITMOS ÚTEIS E ESPECÍFICOS

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

      CASTELO, Antonio e BUENO, Lucas Moutinho e GAMEIRO, Márcio Fuzeto. A combinatorial marching hypercubes algorithm. Computers and Graphics, v. 102, p. 67-77, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cag.2021.10.023. Acesso em: 13 jul. 2024.
    • APA

      Castelo, A., Bueno, L. M., & Gameiro, M. F. (2022). A combinatorial marching hypercubes algorithm. Computers and Graphics, 102, 67-77. doi:10.1016/j.cag.2021.10.023
    • NLM

      Castelo A, Bueno LM, Gameiro MF. A combinatorial marching hypercubes algorithm [Internet]. Computers and Graphics. 2022 ; 102 67-77.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.cag.2021.10.023
    • Vancouver

      Castelo A, Bueno LM, Gameiro MF. A combinatorial marching hypercubes algorithm [Internet]. Computers and Graphics. 2022 ; 102 67-77.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1016/j.cag.2021.10.023
  • Source: PLoS Computational Biology. Unidade: ICMC

    Subjects: HIPÓTESE, EXPRESSÃO GÊNICA, ANÁLISE DE SÉRIES TEMPORAIS

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

      CUMMINS, Breschine et al. Experimental guidance for discovering genetic networks through hypothesis reduction on time series. PLoS Computational Biology, v. 18, n. 10, p. 1-31, 2022Tradução . . Disponível em: https://doi.org/10.1371/journal.pcbi.1010145. Acesso em: 13 jul. 2024.
    • APA

      Cummins, B., Motta, F. C., Moseley, R. C., Deckard, A., Campione, S., Gameiro, M. F., et al. (2022). Experimental guidance for discovering genetic networks through hypothesis reduction on time series. PLoS Computational Biology, 18( 10), 1-31. doi:10.1371/journal.pcbi.1010145
    • NLM

      Cummins B, Motta FC, Moseley RC, Deckard A, Campione S, Gameiro MF, Gedeon T, Mischaikow K, Haase S. Experimental guidance for discovering genetic networks through hypothesis reduction on time series [Internet]. PLoS Computational Biology. 2022 ; 18( 10): 1-31.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1371/journal.pcbi.1010145
    • Vancouver

      Cummins B, Motta FC, Moseley RC, Deckard A, Campione S, Gameiro MF, Gedeon T, Mischaikow K, Haase S. Experimental guidance for discovering genetic networks through hypothesis reduction on time series [Internet]. PLoS Computational Biology. 2022 ; 18( 10): 1-31.[citado 2024 jul. 13 ] Available from: https://doi.org/10.1371/journal.pcbi.1010145

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