Menu

Filtros : "Financiado pela CAPES" "IME-MAC" Removido: "Program" Limpar

Filtros

Refine with date range

1 - 20 (257 records)

  • Artigo de periodico

    CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts (2021)

    Nachtigall, Pedro Gabriel ; Kashiwabara, André Yoshiaki ; Durham, Alan Mitchell

    Source: Briefings in Bioinformatics. Unidade: IME

    Subjects: BIOINFORMÁTICA, SEQUENCIAMENTO GENÉTICO

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

    • ABNT

      NACHTIGALL, Pedro Gabriel e KASHIWABARA, André Yoshiaki e DURHAM, Alan Mitchell. CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts. Briefings in Bioinformatics, v. 22, n. 3, p. 1-11, 2021Tradução . . Disponível em: https://doi.org/10.1093/bib/bbaa045. Acesso em: 06 nov. 2025.

    • APA

      Nachtigall, P. G., Kashiwabara, A. Y., & Durham, A. M. (2021). CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts. Briefings in Bioinformatics, 22( 3), 1-11. doi:10.1093/bib/bbaa045

    • NLM

      Nachtigall PG, Kashiwabara AY, Durham AM. CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts [Internet]. Briefings in Bioinformatics. 2021 ; 22( 3): 1-11.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1093/bib/bbaa045

    • Vancouver

      Nachtigall PG, Kashiwabara AY, Durham AM. CodAn: predictive models for precise identification of coding regions in eukaryotic transcripts [Internet]. Briefings in Bioinformatics. 2021 ; 22( 3): 1-11.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1093/bib/bbaa045

  • Artigo de periodico

    Decomposing split graphs into locally irregular graphs (2021)

    Lintzmayer, Carla Negri ; Mota‬, ‪Guilherme Oliveira ; Sambinelli, Maycon

    Source: Discrete Applied Mathematics. Unidade: IME

    Assunto: 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

      LINTZMAYER, Carla Negri e MOTA‬, ‪Guilherme Oliveira e SAMBINELLI, Maycon. Decomposing split graphs into locally irregular graphs. Discrete Applied Mathematics, v. 292, p. 33-44, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.dam.2020.12.002. Acesso em: 06 nov. 2025.

    • APA

      Lintzmayer, C. N., Mota‬, ‪G. O., & Sambinelli, M. (2021). Decomposing split graphs into locally irregular graphs. Discrete Applied Mathematics, 292, 33-44. doi:10.1016/j.dam.2020.12.002

    • NLM

      Lintzmayer CN, Mota‬ ‪GO, Sambinelli M. Decomposing split graphs into locally irregular graphs [Internet]. Discrete Applied Mathematics. 2021 ; 292 33-44.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.dam.2020.12.002

    • Vancouver

      Lintzmayer CN, Mota‬ ‪GO, Sambinelli M. Decomposing split graphs into locally irregular graphs [Internet]. Discrete Applied Mathematics. 2021 ; 292 33-44.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.dam.2020.12.002

  • Artigo de periodico

    Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN (2021)

    Tinini, Rodrigo Izidoro ; Batista, Daniel Macêdo ; Figueiredo, Gustavo Bittencourt ; Tornatore, Massimo ; Mukherjee, Biswanath

    Source: IEEE Transactions on Green Communications and Networking. Unidade: IME

    Subjects: COMPUTAÇÃO EM NUVEM, CONSERVAÇÃO DE ENERGIA ELÉTRICA

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

    • ABNT

      TININI, Rodrigo Izidoro et al. Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN. IEEE Transactions on Green Communications and Networking, v. 5, n. 1, p. 18-28, 2021Tradução . . Disponível em: https://doi.org/10.1109/TGCN.2020.3035546. Acesso em: 06 nov. 2025.

    • APA

      Tinini, R. I., Batista, D. M., Figueiredo, G. B., Tornatore, M., & Mukherjee, B. (2021). Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN. IEEE Transactions on Green Communications and Networking, 5( 1), 18-28. doi:10.1109/TGCN.2020.3035546

    • NLM

      Tinini RI, Batista DM, Figueiredo GB, Tornatore M, Mukherjee B. Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN [Internet]. IEEE Transactions on Green Communications and Networking. 2021 ; 5( 1): 18-28.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/TGCN.2020.3035546

    • Vancouver

      Tinini RI, Batista DM, Figueiredo GB, Tornatore M, Mukherjee B. Energy-efficient vBBU migration and wavelength reassignment in cloud-fog RAN [Internet]. IEEE Transactions on Green Communications and Networking. 2021 ; 5( 1): 18-28.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/TGCN.2020.3035546

  • Trabalho de evento

    AnubisFlow: a feature extractor for distributed denial of service attack classification (2021)

    Barzilay, Alan ; Martinelli, Caio Lorenzetti; Nogueira, Michele ; Batista, Daniel Macêdo ; Hirata Júnior, Roberto

    Source: Proceedings. Conference titles: International Conference on Network of the Future - NoF. Unidade: IME

    Subjects: MODELOS ANALÍTICOS, CRIME POR COMPUTADOR

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

    • ABNT

      BARZILAY, Alan et al. AnubisFlow: a feature extractor for distributed denial of service attack classification. 2021, Anais.. Piscataway: IEEE, 2021. Disponível em: https://doi.org/10.1109/NoF52522.2021.9609918. Acesso em: 06 nov. 2025.

    • APA

      Barzilay, A., Martinelli, C. L., Nogueira, M., Batista, D. M., & Hirata Júnior, R. (2021). AnubisFlow: a feature extractor for distributed denial of service attack classification. In Proceedings. Piscataway: IEEE. doi:10.1109/NoF52522.2021.9609918

    • NLM

      Barzilay A, Martinelli CL, Nogueira M, Batista DM, Hirata Júnior R. AnubisFlow: a feature extractor for distributed denial of service attack classification [Internet]. Proceedings. 2021 ;[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609918

    • Vancouver

      Barzilay A, Martinelli CL, Nogueira M, Batista DM, Hirata Júnior R. AnubisFlow: a feature extractor for distributed denial of service attack classification [Internet]. Proceedings. 2021 ;[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609918

  • Trabalho de evento

    IoT DDoS detection based on stream learning (2021)

    Arbex, Gustavo Vitral; Machado, Kétly Gonçalves ; Nogueira, Michele ; Batista, Daniel Macêdo ; Hirata Júnior, Roberto

    Source: Proceedings. Conference titles: International Conference on Network of the Future - NoF. Unidade: IME

    Subjects: INTERNET DAS COISAS, SEGURANÇA DE REDES

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

    • ABNT

      ARBEX, Gustavo Vitral et al. IoT DDoS detection based on stream learning. 2021, Anais.. Piscataway: IEEE, 2021. Disponível em: https://doi.org/10.1109/NoF52522.2021.9609940. Acesso em: 06 nov. 2025.

    • APA

      Arbex, G. V., Machado, K. G., Nogueira, M., Batista, D. M., & Hirata Júnior, R. (2021). IoT DDoS detection based on stream learning. In Proceedings. Piscataway: IEEE. doi:10.1109/NoF52522.2021.9609940

    • NLM

      Arbex GV, Machado KG, Nogueira M, Batista DM, Hirata Júnior R. IoT DDoS detection based on stream learning [Internet]. Proceedings. 2021 ;[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609940

    • Vancouver

      Arbex GV, Machado KG, Nogueira M, Batista DM, Hirata Júnior R. IoT DDoS detection based on stream learning [Internet]. Proceedings. 2021 ;[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/NoF52522.2021.9609940

  • Artigo de periodico

    A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives (2021)

    Li, Siyuan ; Ren, Wenqi ; Wang, Feng; Araujo, Iago Breno ; Tokuda, Eric Keiji ; Hirata Júnior, Roberto ; César Júnior, Roberto Marcondes ; Wang, Zhangyang ; Cao, Xiaochun

    Source: International Journal of Computer Vision. Unidade: IME

    Assunto: PROCESSAMENTO DE IMAGENS

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

    • ABNT

      LI, Siyuan et al. A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives. International Journal of Computer Vision, v. 126, p. 1-22, 2021Tradução . . Disponível em: https://doi.org/10.1007/s11263-020-01416-w. Acesso em: 06 nov. 2025.

    • APA

      Li, S., Ren, W., Wang, F., Araujo, I. B., Tokuda, E. K., Hirata Júnior, R., et al. (2021). A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives. International Journal of Computer Vision, 126, 1-22. doi:10.1007/s11263-020-01416-w

    • NLM

      Li S, Ren W, Wang F, Araujo IB, Tokuda EK, Hirata Júnior R, César Júnior RM, Wang Z, Cao X. A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives [Internet]. International Journal of Computer Vision. 2021 ; 126 1-22.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1007/s11263-020-01416-w

    • Vancouver

      Li S, Ren W, Wang F, Araujo IB, Tokuda EK, Hirata Júnior R, César Júnior RM, Wang Z, Cao X. A comprehensive benchmark analysis of single image deraining: current challenges and future perspectives [Internet]. International Journal of Computer Vision. 2021 ; 126 1-22.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1007/s11263-020-01416-w

  • Artigo de periodico

    On Tuza’s conjecture for triangulations and graphs with small treewidth (2021)

    Botler, Fábio Happ ; Fernandes, Cristina Gomes ; Gutiérrez, Juan

    Source: Discrete Mathematics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      BOTLER, Fábio Happ e FERNANDES, Cristina Gomes e GUTIÉRREZ, Juan. On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, v. 344, n. 4, p. 1-12, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2020.112281. Acesso em: 06 nov. 2025.

    • APA

      Botler, F. H., Fernandes, C. G., & Gutiérrez, J. (2021). On Tuza’s conjecture for triangulations and graphs with small treewidth. Discrete Mathematics, 344( 4), 1-12. doi:10.1016/j.disc.2020.112281

    • NLM

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.disc.2020.112281

    • Vancouver

      Botler FH, Fernandes CG, Gutiérrez J. On Tuza’s conjecture for triangulations and graphs with small treewidth [Internet]. Discrete Mathematics. 2021 ; 344( 4): 1-12.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.disc.2020.112281

  • Artigo de periodico

    Classification and evaluation of IoT brokers: a methodology (2021)

    Bertrand-Martinez, Eddas ; Dias Feio, Phelipe; Brito Nascimento, Vagner de; Kon, Fábio ; Abelém, Antônio

    Source: International Journal of Network Management. Unidade: IME

    Assunto: INTERNET DAS COISAS

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

    • ABNT

      BERTRAND-MARTINEZ, Eddas et al. Classification and evaluation of IoT brokers: a methodology. International Journal of Network Management, v. 31, n. 3, 2021Tradução . . Disponível em: https://doi.org/10.1002/nem.2115. Acesso em: 06 nov. 2025.

    • APA

      Bertrand-Martinez, E., Dias Feio, P., Brito Nascimento, V. de, Kon, F., & Abelém, A. (2021). Classification and evaluation of IoT brokers: a methodology. International Journal of Network Management, 31( 3). doi:10.1002/nem.2115

    • NLM

      Bertrand-Martinez E, Dias Feio P, Brito Nascimento V de, Kon F, Abelém A. Classification and evaluation of IoT brokers: a methodology [Internet]. International Journal of Network Management. 2021 ; 31( 3):[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/nem.2115

    • Vancouver

      Bertrand-Martinez E, Dias Feio P, Brito Nascimento V de, Kon F, Abelém A. Classification and evaluation of IoT brokers: a methodology [Internet]. International Journal of Network Management. 2021 ; 31( 3):[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/nem.2115

  • Artigo de periodico

    Finding any given 2-factor in sparse pseudorandom graphs efficiently (2021)

    Han, Jie ; Kohayakawa, Yoshiharu ; Morris, Patrick; Person, Yury

    Source: Journal of Graph Theory. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      HAN, Jie et al. Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, v. 96, n. 1, p. 87-108, 2021Tradução . . Disponível em: https://doi.org/10.1002/jgt.22576. Acesso em: 06 nov. 2025.

    • APA

      Han, J., Kohayakawa, Y., Morris, P., & Person, Y. (2021). Finding any given 2-factor in sparse pseudorandom graphs efficiently. Journal of Graph Theory, 96( 1), 87-108. doi:10.1002/jgt.22576

    • NLM

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/jgt.22576

    • Vancouver

      Han J, Kohayakawa Y, Morris P, Person Y. Finding any given 2-factor in sparse pseudorandom graphs efficiently [Internet]. Journal of Graph Theory. 2021 ; 96( 1): 87-108.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/jgt.22576

  • Artigo de periodico

    Towards a quantitative survey of dimension reduction techniques (2021)

    Espadoto, Mateus ; Martins, Rafael M.; Kerren, Andreas ; Hirata, Nina Sumiko Tomita ; Telea, Alexandru Cristian

    Source: IEEE Transactions on Visualization and Computer Graphics. Unidade: IME

    Assunto: APRENDIZADO COMPUTACIONAL

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

    • ABNT

      ESPADOTO, Mateus et al. Towards a quantitative survey of dimension reduction techniques. IEEE Transactions on Visualization and Computer Graphics, v. 27, n. 3, p. 2153-2173, 2021Tradução . . Disponível em: https://doi.org/10.1109/tvcg.2019.2944182. Acesso em: 06 nov. 2025.

    • APA

      Espadoto, M., Martins, R. M., Kerren, A., Hirata, N. S. T., & Telea, A. C. (2021). Towards a quantitative survey of dimension reduction techniques. IEEE Transactions on Visualization and Computer Graphics, 27( 3), 2153-2173. doi:10.1109/tvcg.2019.2944182

    • NLM

      Espadoto M, Martins RM, Kerren A, Hirata NST, Telea AC. Towards a quantitative survey of dimension reduction techniques [Internet]. IEEE Transactions on Visualization and Computer Graphics. 2021 ; 27( 3): 2153-2173.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/tvcg.2019.2944182

    • Vancouver

      Espadoto M, Martins RM, Kerren A, Hirata NST, Telea AC. Towards a quantitative survey of dimension reduction techniques [Internet]. IEEE Transactions on Visualization and Computer Graphics. 2021 ; 27( 3): 2153-2173.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/tvcg.2019.2944182

  • Artigo de periodico

    A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis (2021)

    Jorge, Carlos Antônio Campos ; Nery, Alexandre S.; Melo, Alba Cristina Magalhães Alves de ; Goldman, Alfredo

    Source: Concurrency and Computation: Practice and Experience. Unidade: IME

    Subjects: ALGORITMOS PARA PROCESSAMENTO, PROGRAMAÇÃO DINÂMICA

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

    • ABNT

      JORGE, Carlos Antônio Campos et al. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis. Concurrency and Computation: Practice and Experience, v. 33, n. 4, 2021Tradução . . Disponível em: https://doi.org/10.1002/cpe.6007. Acesso em: 06 nov. 2025.

    • APA

      Jorge, C. A. C., Nery, A. S., Melo, A. C. M. A. de, & Goldman, A. (2021). A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis. Concurrency and Computation: Practice and Experience, 33( 4). doi:10.1002/cpe.6007

    • NLM

      Jorge CAC, Nery AS, Melo ACMA de, Goldman A. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis [Internet]. Concurrency and Computation: Practice and Experience. 2021 ; 33( 4):[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/cpe.6007

    • Vancouver

      Jorge CAC, Nery AS, Melo ACMA de, Goldman A. A CPU-FPGA heterogeneous approach for biological sequence comparison using high-level synthesis [Internet]. Concurrency and Computation: Practice and Experience. 2021 ; 33( 4):[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/cpe.6007

  • Artigo de periodico

    Improving parallelism in Git and GNU: strategies, difficulties, and lessons learned (2021)

    Bernardino, Matheus Tavares ; Belinassi, Giuliano; Meirelles, Paulo ; Guerra, Eduardo Martins ; Goldman, Alfredo

    Source: IEEE Software. Unidade: IME

    Subjects: PROGRAMAÇÃO PARALELA, SOFTWARE LIVRE

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

    • ABNT

      BERNARDINO, Matheus Tavares et al. Improving parallelism in Git and GNU: strategies, difficulties, and lessons learned. IEEE Software, v. 38, n. 5, p. 92-100, 2021Tradução . . Disponível em: https://doi.org/10.1109/MS.2020.3020932. Acesso em: 06 nov. 2025.

    • APA

      Bernardino, M. T., Belinassi, G., Meirelles, P., Guerra, E. M., & Goldman, A. (2021). Improving parallelism in Git and GNU: strategies, difficulties, and lessons learned. IEEE Software, 38( 5), 92-100. doi:10.1109/MS.2020.3020932

    • NLM

      Bernardino MT, Belinassi G, Meirelles P, Guerra EM, Goldman A. Improving parallelism in Git and GNU: strategies, difficulties, and lessons learned [Internet]. IEEE Software. 2021 ; 38( 5): 92-100.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/MS.2020.3020932

    • Vancouver

      Bernardino MT, Belinassi G, Meirelles P, Guerra EM, Goldman A. Improving parallelism in Git and GNU: strategies, difficulties, and lessons learned [Internet]. IEEE Software. 2021 ; 38( 5): 92-100.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1109/MS.2020.3020932

  • Artigo de periodico

    Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon (2021)

    Fernandes, Cristina Gomes ; Pina Júnior, José Coelho de ; Ramírez Alfonsín, Jorge Luis; Robins, Sinai

    Source: Discrete & Computational Geometry. Unidade: IME

    Subjects: ENUMERAÇÃO E IDENTIDADE COMBINATÓRIAS, 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

      FERNANDES, Cristina Gomes et al. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, v. 65, n. 1, p. 227-243, 2021Tradução . . Disponível em: https://doi.org/10.1007/s00454-020-00192-1. Acesso em: 06 nov. 2025.

    • APA

      Fernandes, C. G., Pina Júnior, J. C. de, Ramírez Alfonsín, J. L., & Robins, S. (2021). Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon. Discrete & Computational Geometry, 65( 1), 227-243. doi:10.1007/s00454-020-00192-1

    • NLM

      Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1007/s00454-020-00192-1

    • Vancouver

      Fernandes CG, Pina Júnior JC de, Ramírez Alfonsín JL, Robins S. Cubic graphs, their ehrhart quasi-polynomials, and a scissors congruence phenomenon [Internet]. Discrete & Computational Geometry. 2021 ; 65( 1): 227-243.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1007/s00454-020-00192-1

  • Artigo de periodico

    Transitioning to a driverless city: evaluating a hybrid system for autonomous and non-autonomous vehicles (2021)

    Santana, Eduardo Felipe Zambom ; Covas, Gustavo; Duarte, Fábio ; Santi, Paolo ; Ratti, Carlo ; Kon, Fábio

    Source: Simulation Modelling Practice and Theory. Unidade: IME

    Subjects: CIDADES INTELIGENTES, SISTEMAS INTELIGENTES DE TRANSPORTES, SISTEMAS HÍBRIDOS, VEÍCULOS AUTÔNOMOS, CONTROLE DE TRÁFEGO

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

    • ABNT

      SANTANA, Eduardo Felipe Zambom et al. Transitioning to a driverless city: evaluating a hybrid system for autonomous and non-autonomous vehicles. Simulation Modelling Practice and Theory, v. 107, p. 1-14, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.simpat.2020.102210. Acesso em: 06 nov. 2025.

    • APA

      Santana, E. F. Z., Covas, G., Duarte, F., Santi, P., Ratti, C., & Kon, F. (2021). Transitioning to a driverless city: evaluating a hybrid system for autonomous and non-autonomous vehicles. Simulation Modelling Practice and Theory, 107, 1-14. doi:10.1016/j.simpat.2020.102210

    • NLM

      Santana EFZ, Covas G, Duarte F, Santi P, Ratti C, Kon F. Transitioning to a driverless city: evaluating a hybrid system for autonomous and non-autonomous vehicles [Internet]. Simulation Modelling Practice and Theory. 2021 ; 107 1-14.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.simpat.2020.102210

    • Vancouver

      Santana EFZ, Covas G, Duarte F, Santi P, Ratti C, Kon F. Transitioning to a driverless city: evaluating a hybrid system for autonomous and non-autonomous vehicles [Internet]. Simulation Modelling Practice and Theory. 2021 ; 107 1-14.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.simpat.2020.102210

  • Artigo de periodico

    The size-Ramsey number of powers of bounded degree trees (2021)

    Berger, Sören; Kohayakawa, Yoshiharu ; Maesaka, Giulia Satiko; Martins, Taísa ; Mendonça, Walner; Mota, Guilherme Oliveira ; Parczyk, Olaf

    Source: Journal of the London Mathematical Society. Unidade: IME

    Assunto: 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

      BERGER, Sören et al. The size-Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, v. 103, n. 4, p. 1314-1332, 2021Tradução . . Disponível em: https://doi.org/10.1112/jlms.12408. Acesso em: 06 nov. 2025.

    • APA

      Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., & Parczyk, O. (2021). The size-Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, 103( 4), 1314-1332. doi:10.1112/jlms.12408

    • NLM

      Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Journal of the London Mathematical Society. 2021 ; 103( 4): 1314-1332.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1112/jlms.12408

    • Vancouver

      Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Journal of the London Mathematical Society. 2021 ; 103( 4): 1314-1332.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1112/jlms.12408

  • Artigo de periodico

    Counting restricted orientations of random graphs (2020)

    Collares, Maurício ; Kohayakawa, Yoshiharu ; Morris, Robert; Mota, Guilherme Oliveira

    Source: Random Structures & Algorithms. Unidade: IME

    Assunto: GRAFOS ALEATÓRIOS

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

    • ABNT

      COLLARES, Maurício et al. Counting restricted orientations of random graphs. Random Structures & Algorithms, v. 56, n. 4, p. 1016-1030, 2020Tradução . . Disponível em: https://doi.org/10.1002/rsa.20904. Acesso em: 06 nov. 2025.

    • APA

      Collares, M., Kohayakawa, Y., Morris, R., & Mota, G. O. (2020). Counting restricted orientations of random graphs. Random Structures & Algorithms, 56( 4), 1016-1030. doi:10.1002/rsa.20904

    • NLM

      Collares M, Kohayakawa Y, Morris R, Mota GO. Counting restricted orientations of random graphs [Internet]. Random Structures & Algorithms. 2020 ; 56( 4): 1016-1030.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/rsa.20904

    • Vancouver

      Collares M, Kohayakawa Y, Morris R, Mota GO. Counting restricted orientations of random graphs [Internet]. Random Structures & Algorithms. 2020 ; 56( 4): 1016-1030.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1002/rsa.20904

  • Trabalho de evento

    Improving neural network-based multidimensional projections (2020)

    Espadoto, Mateus ; Hirata, Nina Sumiko Tomita ; Falcão, Alexandre Xavier ; Telea, Alexandru Cristian

    Source: Proceedings. Conference titles: International joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - VISIGRAPP. Unidade: IME

    Subjects: APRENDIZADO COMPUTACIONAL, REDES NEURAIS

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

    • ABNT

      ESPADOTO, Mateus et al. Improving neural network-based multidimensional projections. 2020, Anais.. Lisboa: SciTePress, 2020. Disponível em: https://doi.org/10.5220/0008877200290041. Acesso em: 06 nov. 2025.

    • APA

      Espadoto, M., Hirata, N. S. T., Falcão, A. X., & Telea, A. C. (2020). Improving neural network-based multidimensional projections. In Proceedings. Lisboa: SciTePress. doi:10.5220/0008877200290041

    • NLM

      Espadoto M, Hirata NST, Falcão AX, Telea AC. Improving neural network-based multidimensional projections [Internet]. Proceedings. 2020 ;[citado 2025 nov. 06 ] Available from: https://doi.org/10.5220/0008877200290041

    • Vancouver

      Espadoto M, Hirata NST, Falcão AX, Telea AC. Improving neural network-based multidimensional projections [Internet]. Proceedings. 2020 ;[citado 2025 nov. 06 ] Available from: https://doi.org/10.5220/0008877200290041

  • Trabalho de evento-resumo periodico

    Efficient predictive uncertainty estimators for deep probabilistic models (2020)

    Llerena, Julissa Villanueva ; Mauá, Denis Deratani

    Source: Proceddings : AAAI-20 Student Tracks. Conference titles: AAAI Conference on Artificial Intelligence - AAAI. Unidade: IME

    Assunto: MODELOS PARA PROCESSOS ESTOCÁSTICOS

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

    • ABNT

      LLERENA, Julissa Villanueva e MAUÁ, Denis Deratani. Efficient predictive uncertainty estimators for deep probabilistic models. Proceddings : AAAI-20 Student Tracks. Palo Alto: AAAI Press. Disponível em: https://doi.org/10.1609/aaai.v34i10.7142. Acesso em: 06 nov. 2025. , 2020

    • APA

      Llerena, J. V., & Mauá, D. D. (2020). Efficient predictive uncertainty estimators for deep probabilistic models. Proceddings : AAAI-20 Student Tracks. Palo Alto: AAAI Press. doi:10.1609/aaai.v34i10.7142

    • NLM

      Llerena JV, Mauá DD. Efficient predictive uncertainty estimators for deep probabilistic models [Internet]. Proceddings : AAAI-20 Student Tracks. 2020 ; 35( 100): 13740-13741.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1609/aaai.v34i10.7142

    • Vancouver

      Llerena JV, Mauá DD. Efficient predictive uncertainty estimators for deep probabilistic models [Internet]. Proceddings : AAAI-20 Student Tracks. 2020 ; 35( 100): 13740-13741.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1609/aaai.v34i10.7142

  • Artigo de periodico

    A new approach for pedestrian density estimation using moving sensors and computer vision (2020)

    Tokuda, Eric Keiji ; Lockerman, Yitzchak; Ferreira, Gabriel Augusto Bianchi Azevedo; Sorrelgreen, Ethan; Boyle, David; César Júnior, Roberto Marcondes ; Silva, Claudio T

    Source: ACM Transactions on Spatial Algorithms and Systems. Unidades: IME, IFSC

    Subjects: SISTEMAS DE INFORMAÇÃO, MINERAÇÃO DE DADOS

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

    • ABNT

      TOKUDA, Eric Keiji et al. A new approach for pedestrian density estimation using moving sensors and computer vision. ACM Transactions on Spatial Algorithms and Systems, v. 6, n. 4, p. 26-1-26-20, 2020Tradução . . Disponível em: https://doi.org/10.1145/3397575. Acesso em: 06 nov. 2025.

    • APA

      Tokuda, E. K., Lockerman, Y., Ferreira, G. A. B. A., Sorrelgreen, E., Boyle, D., César Júnior, R. M., & Silva, C. T. (2020). A new approach for pedestrian density estimation using moving sensors and computer vision. ACM Transactions on Spatial Algorithms and Systems, 6( 4), 26-1-26-20. doi:10.1145/3397575

    • NLM

      Tokuda EK, Lockerman Y, Ferreira GABA, Sorrelgreen E, Boyle D, César Júnior RM, Silva CT. A new approach for pedestrian density estimation using moving sensors and computer vision [Internet]. ACM Transactions on Spatial Algorithms and Systems. 2020 ;6( 4): 26-1-26-20.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1145/3397575

    • Vancouver

      Tokuda EK, Lockerman Y, Ferreira GABA, Sorrelgreen E, Boyle D, César Júnior RM, Silva CT. A new approach for pedestrian density estimation using moving sensors and computer vision [Internet]. ACM Transactions on Spatial Algorithms and Systems. 2020 ;6( 4): 26-1-26-20.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1145/3397575

  • Artigo de periodico

    Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts (2020)

    Bejar, Hans H. C ; Guimaraes, Silvio Jamil Ferzoli ; Miranda, Paulo André Vechiatto de

    Source: Pattern Recognition Letters. Unidade: IME

    Subjects: INTERPOLAÇÃO, APROXIMAÇÃO POR POLINÔMIOS, CAD

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

    • ABNT

      BEJAR, Hans H. C e GUIMARAES, Silvio Jamil Ferzoli e MIRANDA, Paulo André Vechiatto de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts. Pattern Recognition Letters, v. 131, p. 185-192, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.01.008. Acesso em: 06 nov. 2025.

    • APA

      Bejar, H. H. C., Guimaraes, S. J. F., & Miranda, P. A. V. de. (2020). Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts. Pattern Recognition Letters, 131, 185-192. doi:10.1016/j.patrec.2020.01.008

    • NLM

      Bejar HHC, Guimaraes SJF, Miranda PAV de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts [Internet]. Pattern Recognition Letters. 2020 ; 131 185-192.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.patrec.2020.01.008

    • Vancouver

      Bejar HHC, Guimaraes SJF, Miranda PAV de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts [Internet]. Pattern Recognition Letters. 2020 ; 131 185-192.[citado 2025 nov. 06 ] Available from: https://doi.org/10.1016/j.patrec.2020.01.008

1 - 20 (257 records)

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