ReP USP - Resultado da busca

Trabalho de evento
Biological sequence analysis using complex networks and entropy maximization: a case study in SARS-CoV-2 (2023)
Pimenta-Zanon, Matheus H. ; de Souza, Vinicius Augusto; Hashimoto, Ronaldo Fumio ; Lopes, Fabricio Martins
Fonte: Ambient intelligence in health care : proceedings. Nome do evento: International Conference on Ambient Intelligence in Health Care - ICAIHC. Unidade: IME
Assuntos: REDES COMPLEXAS, ENTROPIA, COVID-19, ANÁLISE SEQUENCIAL, BIOINFORMÁTICA, RECONHECIMENTO DE PADRÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PIMENTA-ZANON, Matheus H. et al. Biological sequence analysis using complex networks and entropy maximization: a case study in SARS-CoV-2. 2023, Anais.. Heidelberg: Springer, 2023. Disponível em: https://doi.org/10.1007/978-981-19-6068-0_44. Acesso em: 18 out. 2024.
APA
Pimenta-Zanon, M. H., de Souza, V. A., Hashimoto, R. F., & Lopes, F. M. (2023). Biological sequence analysis using complex networks and entropy maximization: a case study in SARS-CoV-2. In Ambient intelligence in health care : proceedings. Heidelberg: Springer. doi:10.1007/978-981-19-6068-0_44
NLM
Pimenta-Zanon MH, de Souza VA, Hashimoto RF, Lopes FM. Biological sequence analysis using complex networks and entropy maximization: a case study in SARS-CoV-2 [Internet]. Ambient intelligence in health care : proceedings. 2023 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-981-19-6068-0_44
Vancouver
Pimenta-Zanon MH, de Souza VA, Hashimoto RF, Lopes FM. Biological sequence analysis using complex networks and entropy maximization: a case study in SARS-CoV-2 [Internet]. Ambient intelligence in health care : proceedings. 2023 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-981-19-6068-0_44
Artigo de periodico
Positive artificial intelligence meets affective walkability (2022)
Bandini, Stefania ; Gasparini, Framcesca; Silva, Flávio Soares Corrêa da
Fonte: Intelligent Systems Reference Library: Living Beyond Data. Unidade: IME
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BANDINI, Stefania e GASPARINI, Framcesca e SILVA, Flávio Soares Corrêa da. Positive artificial intelligence meets affective walkability. Intelligent Systems Reference Library: Living Beyond Data, v. 230, n. , p. 161-178, 2022Tradução . . Disponível em: https://doi.org/10.1007/978-3-031-11593-6_9. Acesso em: 18 out. 2024.
APA
Bandini, S., Gasparini, F., & Silva, F. S. C. da. (2022). Positive artificial intelligence meets affective walkability. Intelligent Systems Reference Library: Living Beyond Data, 230( ), 161-178. doi:10.1007/978-3-031-11593-6_9
NLM
Bandini S, Gasparini F, Silva FSC da. Positive artificial intelligence meets affective walkability [Internet]. Intelligent Systems Reference Library: Living Beyond Data. 2022 ; 230( ): 161-178.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-031-11593-6_9
Vancouver
Bandini S, Gasparini F, Silva FSC da. Positive artificial intelligence meets affective walkability [Internet]. Intelligent Systems Reference Library: Living Beyond Data. 2022 ; 230( ): 161-178.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-031-11593-6_9
Artigo de periodico
Abstracting mobility flows from bike-sharing systems (2022)
Kon, Fábio ; Ferreira, Éderson Cássio ; Souza, Higor Amario de ; Duarte, Fábio ; Santi, Paolo ; Ratti, Carlo
Fonte: Public Transport. Unidades: IME, EACH
Assuntos: MOBILIDADE URBANA, TRANSPORTE URBANO, BICICLETAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KON, Fábio et al. Abstracting mobility flows from bike-sharing systems. Public Transport, v. 14, n. 3, p. 545-581, 2022Tradução . . Disponível em: https://doi.org/10.1007/s12469-020-00259-5. Acesso em: 18 out. 2024.
APA
Kon, F., Ferreira, É. C., Souza, H. A. de, Duarte, F., Santi, P., & Ratti, C. (2022). Abstracting mobility flows from bike-sharing systems. Public Transport, 14( 3), 545-581. doi:10.1007/s12469-020-00259-5
NLM
Kon F, Ferreira ÉC, Souza HA de, Duarte F, Santi P, Ratti C. Abstracting mobility flows from bike-sharing systems [Internet]. Public Transport. 2022 ; 14( 3): 545-581.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s12469-020-00259-5
Vancouver
Kon F, Ferreira ÉC, Souza HA de, Duarte F, Santi P, Ratti C. Abstracting mobility flows from bike-sharing systems [Internet]. Public Transport. 2022 ; 14( 3): 545-581.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s12469-020-00259-5
Artigo de periodico
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming (2022)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, H. ; Santos, D. O.; Silveira, ‪Thiago Parente da
Fonte: Optimization Letters. Unidade: IME
Assuntos: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. Optimization Letters, v. 16, n. 2, p. 589-610, 2022Tradução . . Disponível em: https://doi.org/10.1007/s11590-021-01737-w. Acesso em: 18 out. 2024.
APA
Andreani, R., Haeser, G., Mito, L., Ramírez, H., Santos, D. O., & Silveira, ‪T. P. da. (2022). Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming. Optimization Letters, 16( 2), 589-610. doi:10.1007/s11590-021-01737-w
NLM
Andreani R, Haeser G, Mito L, Ramírez H, Santos DO, Silveira ‪TP da. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming [Internet]. Optimization Letters. 2022 ; 16( 2): 589-610.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s11590-021-01737-w
Vancouver
Andreani R, Haeser G, Mito L, Ramírez H, Santos DO, Silveira ‪TP da. Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming [Internet]. Optimization Letters. 2022 ; 16( 2): 589-610.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s11590-021-01737-w
Artigo de periodico
Left ideals of matrix rings and error-correcting codes (2021)
Ferraz, Raul Antonio ; Polcino Milies, Francisco César ; Taufer, Edite
Fonte: Applicable Algebra in Engineering, Communication and Computing. Unidade: IME
Assuntos: ANÉIS E ÁLGEBRAS ASSOCIATIVOS, CODIFICAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERRAZ, Raul Antonio e POLCINO MILIES, Francisco César e TAUFER, Edite. Left ideals of matrix rings and error-correcting codes. Applicable Algebra in Engineering, Communication and Computing, v. 32, p. 311-320, 2021Tradução . . Disponível em: https://doi.org/10.1007/s00200-021-00498-4. Acesso em: 18 out. 2024.
APA
Ferraz, R. A., Polcino Milies, F. C., & Taufer, E. (2021). Left ideals of matrix rings and error-correcting codes. Applicable Algebra in Engineering, Communication and Computing, 32, 311-320. doi:10.1007/s00200-021-00498-4
NLM
Ferraz RA, Polcino Milies FC, Taufer E. Left ideals of matrix rings and error-correcting codes [Internet]. Applicable Algebra in Engineering, Communication and Computing. 2021 ; 32 311-320.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s00200-021-00498-4
Vancouver
Ferraz RA, Polcino Milies FC, Taufer E. Left ideals of matrix rings and error-correcting codes [Internet]. Applicable Algebra in Engineering, Communication and Computing. 2021 ; 32 311-320.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s00200-021-00498-4
Artigo de periodico
On the onset of diffusion in the kicked Harper model (2021)
Jäger, Tobias ; Koropecki, Andres ; Tal, Fábio Armando
Fonte: Communications in Mathematical Physics. Unidade: IME
Assuntos: SISTEMAS HAMILTONIANOS, SISTEMAS DINÂMICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
JÄGER, Tobias e KOROPECKI, Andres e TAL, Fábio Armando. On the onset of diffusion in the kicked Harper model. Communications in Mathematical Physics, v. 383, p. 953-980, 2021Tradução . . Disponível em: https://doi.org/10.1007/s00220-021-03995-2. Acesso em: 18 out. 2024.
APA
Jäger, T., Koropecki, A., & Tal, F. A. (2021). On the onset of diffusion in the kicked Harper model. Communications in Mathematical Physics, 383, 953-980. doi:10.1007/s00220-021-03995-2
NLM
Jäger T, Koropecki A, Tal FA. On the onset of diffusion in the kicked Harper model [Internet]. Communications in Mathematical Physics. 2021 ; 383 953-980.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s00220-021-03995-2
Vancouver
Jäger T, Koropecki A, Tal FA. On the onset of diffusion in the kicked Harper model [Internet]. Communications in Mathematical Physics. 2021 ; 383 953-980.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s00220-021-03995-2
Artigo de periodico
A robust Birnbaum–Saunders regression model based on asymmetric heavy-tailed distributions (2021)
Maehara, Rocío ; Bolfarine, Heleno ; Vilca, Filidor ; Balakrishnan, N.
Fonte: Metrika. Unidade: IME
Assuntos: ANÁLISE DE REGRESSÃO E DE CORRELAÇÃO NÃO LINEAR, DISTRIBUIÇÕES (PROBABILIDADE)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAEHARA, Rocío et al. A robust Birnbaum–Saunders regression model based on asymmetric heavy-tailed distributions. Metrika, v. 84, p. 1049-1080, 2021Tradução . . Disponível em: https://doi.org/10.1007/s00184-021-00815-4. Acesso em: 18 out. 2024.
APA
Maehara, R., Bolfarine, H., Vilca, F., & Balakrishnan, N. (2021). A robust Birnbaum–Saunders regression model based on asymmetric heavy-tailed distributions. Metrika, 84, 1049-1080. doi:10.1007/s00184-021-00815-4
NLM
Maehara R, Bolfarine H, Vilca F, Balakrishnan N. A robust Birnbaum–Saunders regression model based on asymmetric heavy-tailed distributions [Internet]. Metrika. 2021 ; 84 1049-1080.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s00184-021-00815-4
Vancouver
Maehara R, Bolfarine H, Vilca F, Balakrishnan N. A robust Birnbaum–Saunders regression model based on asymmetric heavy-tailed distributions [Internet]. Metrika. 2021 ; 84 1049-1080.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s00184-021-00815-4
Outros
Commentary to “On a list of ordinary differential equations problems” (2019)
Gorodski, Claudio
Fonte: São Paulo Journal of Mathematical Sciences. Unidade: IME
Assunto: SISTEMAS DINÂMICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GORODSKI, Claudio. Commentary to “On a list of ordinary differential equations problems”. São Paulo Journal of Mathematical Sciences. Heidelberg: Springer. Disponível em: https://doi.org/10.1007/s40863-019-00135-6. Acesso em: 18 out. 2024. , 2019
APA
Gorodski, C. (2019). Commentary to “On a list of ordinary differential equations problems”. São Paulo Journal of Mathematical Sciences. Heidelberg: Springer. doi:10.1007/s40863-019-00135-6
NLM
Gorodski C. Commentary to “On a list of ordinary differential equations problems” [Internet]. São Paulo Journal of Mathematical Sciences. 2019 ; 13( 2): 721.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s40863-019-00135-6
Vancouver
Gorodski C. Commentary to “On a list of ordinary differential equations problems” [Internet]. São Paulo Journal of Mathematical Sciences. 2019 ; 13( 2): 721.[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/s40863-019-00135-6
Trabalho de evento
On commuting U-operators in Jordan algebras (2016)
Shestakov, Ivan P
Fonte: Proceedings. Nome do evento: Non-Associative and Non-Commutative Algebra and Operator Theory - NANCAOT : Workshop in Honor of Professor Amin Kaidi. Unidade: IME
Assunto: ÁLGEBRAS DE JORDAN
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SHESTAKOV, Ivan P. On commuting U-operators in Jordan algebras. 2016, Anais.. Berlin: Springer, 2016. Disponível em: https://doi.org/10.1007/978-3-319-32902-4_6. Acesso em: 18 out. 2024.
APA
Shestakov, I. P. (2016). On commuting U-operators in Jordan algebras. In Proceedings. Berlin: Springer. doi:10.1007/978-3-319-32902-4_6
NLM
Shestakov IP. On commuting U-operators in Jordan algebras [Internet]. Proceedings. 2016 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-319-32902-4_6
Vancouver
Shestakov IP. On commuting U-operators in Jordan algebras [Internet]. Proceedings. 2016 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-319-32902-4_6
Trabalho de evento
Improved approximation algorithms for capacitated fault-tolerant k-center (2016)
Fernandes, Cristina Gomes ; Paula, Samuel P. de
Fonte: Proceedings. Nome do evento: Latin American Theoretical Informatics Symposium - LATIN. Unidade: IME
Assuntos: CIÊNCIA DA COMPUTAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e PAULA, Samuel P. de. Improved approximation algorithms for capacitated fault-tolerant k-center. 2016, Anais.. Berlin: Springer, 2016. Disponível em: https://doi.org/10.1007/978-3-662-49529-2_33. Acesso em: 18 out. 2024.
APA
Fernandes, C. G., & Paula, S. P. de. (2016). Improved approximation algorithms for capacitated fault-tolerant k-center. In Proceedings. Berlin: Springer. doi:10.1007/978-3-662-49529-2_33
NLM
Fernandes CG, Paula SP de. Improved approximation algorithms for capacitated fault-tolerant k-center [Internet]. Proceedings. 2016 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-662-49529-2_33
Vancouver
Fernandes CG, Paula SP de. Improved approximation algorithms for capacitated fault-tolerant k-center [Internet]. Proceedings. 2016 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-662-49529-2_33
Trabalho de evento-resumo
How to support newcomers onboarding to open source software projects (2014)
Steinmacher, Igor; Gerosa, Marco Aurélio
Fonte: Open source software: mobile open source technologies. Nome do evento: International Conference on Open Source Systems - OSS. Unidade: IME
Assuntos: SOFTWARE LIVRE, ENGENHARIA DE SOFTWARE, DESENVOLVIMENTO DE SOFTWARE, ADMINISTRAÇÃO DE EMPRESAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
STEINMACHER, Igor e GEROSA, Marco Aurélio. How to support newcomers onboarding to open source software projects. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-55128-4_29. Acesso em: 18 out. 2024.
APA
Steinmacher, I., & Gerosa, M. A. (2014). How to support newcomers onboarding to open source software projects. In Open source software: mobile open source technologies. Heidelberg: Springer. doi:10.1007/978-3-642-55128-4_29
NLM
Steinmacher I, Gerosa MA. How to support newcomers onboarding to open source software projects [Internet]. Open source software: mobile open source technologies. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-55128-4_29
Vancouver
Steinmacher I, Gerosa MA. How to support newcomers onboarding to open source software projects [Internet]. Open source software: mobile open source technologies. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-55128-4_29
Trabalho de evento
Barriers faced by newcomers to open source projects: a systematic review (2014)
Steinmacher, Igor; Silva, Marco Aurélio Graciotto; Gerosa, Marco Aurélio
Fonte: Open source software: mobile open source technologies. Nome do evento: International Conference on Open Source Systems - OSS. Unidade: IME
Assuntos: SOFTWARE LIVRE, BIBLIOTECA DIGITAL, ENGENHARIA DE SOFTWARE, DESENVOLVIMENTO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
STEINMACHER, Igor e SILVA, Marco Aurélio Graciotto e GEROSA, Marco Aurélio. Barriers faced by newcomers to open source projects: a systematic review. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-55128-4_21. Acesso em: 18 out. 2024.
APA
Steinmacher, I., Silva, M. A. G., & Gerosa, M. A. (2014). Barriers faced by newcomers to open source projects: a systematic review. In Open source software: mobile open source technologies. Heidelberg: Springer. doi:10.1007/978-3-642-55128-4_21
NLM
Steinmacher I, Silva MAG, Gerosa MA. Barriers faced by newcomers to open source projects: a systematic review [Internet]. Open source software: mobile open source technologies. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-55128-4_21
Vancouver
Steinmacher I, Silva MAG, Gerosa MA. Barriers faced by newcomers to open source projects: a systematic review [Internet]. Open source software: mobile open source technologies. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-55128-4_21
Trabalho de evento
Approximation algorithms for the max-buying problem with limited supply (2014)
Fernandes, Cristina Gomes ; Schouery, Rafael Crivellari Saliba
Fonte: LATIN 2014: theoretical informatics: Proceedings. Nome do evento: Latin American on Theoretical Informatics Symposium - LATIN 2014. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS JOGOS, ALGORITMOS DE APROXIMAÇÃO, ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHOUERY, Rafael Crivellari Saliba. Approximation algorithms for the max-buying problem with limited supply. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54423-1_61. Acesso em: 18 out. 2024.
APA
Fernandes, C. G., & Schouery, R. C. S. (2014). Approximation algorithms for the max-buying problem with limited supply. In LATIN 2014: theoretical informatics: Proceedings. Heidelberg: Springer. doi:10.1007/978-3-642-54423-1_61
NLM
Fernandes CG, Schouery RCS. Approximation algorithms for the max-buying problem with limited supply [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_61
Vancouver
Fernandes CG, Schouery RCS. Approximation algorithms for the max-buying problem with limited supply [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_61
Trabalho de evento
Powers of Hamilton cycles in pseudorandom graphs (2014)
Allen, Peter; Bottcher, Julia; Hàn, Hiêp; Kohayakawa, Yoshiharu ; Person, Yury
Fonte: LATIN 2014: theoretical informatics: Proceedings. Nome do evento: Latin American on Theoretical Informatics Symposium - LATIN 2014. Unidade: IME
Assuntos: ANÁLISE DE ALGORITMOS, COMPUTABILIDADE E COMPLEXIDADE, MATEMÁTICA DISCRETA, ESTRUTURAS DE DADOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Powers of Hamilton cycles in pseudorandom graphs. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54423-1_31. Acesso em: 18 out. 2024.
APA
Allen, P., Bottcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2014). Powers of Hamilton cycles in pseudorandom graphs. In LATIN 2014: theoretical informatics: Proceedings. Heidelberg: Springer. doi:10.1007/978-3-642-54423-1_31
NLM
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
Vancouver
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
Trabalho de evento
Improved object matching using structural relations (2014)
Wandekoken, Estephan Dazzi; Campos, Teófilo Emídio de; César Júnior, Roberto Marcondes
Fonte: Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshop, S+SSPR 2014, Joensuu, Finland, August 20-22, 2014. Proceedings. Nome do evento: Joint International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) - S+SSPR. Unidade: IME
Assuntos: INTELIGÊNCIA ARTIFICIAL, VISÃO COMPUTACIONAL, COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
WANDEKOKEN, Estephan Dazzi e CAMPOS, Teófilo Emídio de e CÉSAR JÚNIOR, Roberto Marcondes. Improved object matching using structural relations. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-662-44415-3_45. Acesso em: 18 out. 2024.
APA
Wandekoken, E. D., Campos, T. E. de, & César Júnior, R. M. (2014). Improved object matching using structural relations. In Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshop, S+SSPR 2014, Joensuu, Finland, August 20-22, 2014. Proceedings. Heidelberg: Springer. doi:10.1007/978-3-662-44415-3_45
NLM
Wandekoken ED, Campos TE de, César Júnior RM. Improved object matching using structural relations [Internet]. Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshop, S+SSPR 2014, Joensuu, Finland, August 20-22, 2014. Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-662-44415-3_45
Vancouver
Wandekoken ED, Campos TE de, César Júnior RM. Improved object matching using structural relations [Internet]. Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshop, S+SSPR 2014, Joensuu, Finland, August 20-22, 2014. Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-662-44415-3_45
Trabalho de evento
Shocks and antishocks in the ASEP conditioned on a low current (2014)
Belitsky, Vladimir ; Schutz, Gunter M
Fonte: From particle systems to partial differential equations: particle systems and PDEs, Braga, Portugal, December 2012. Nome do evento: Particle Systems and Partial Differential Equations. Unidade: IME
Assuntos: EQUAÇÕES DIFERENCIAIS PARCIAIS, PROBABILIDADE, PROCESSOS ESTOCÁSTICOS, FÍSICA COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BELITSKY, Vladimir e SCHUTZ, Gunter M. Shocks and antishocks in the ASEP conditioned on a low current. 2014, Anais.. Berlin: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54271-8_3. Acesso em: 18 out. 2024.
APA
Belitsky, V., & Schutz, G. M. (2014). Shocks and antishocks in the ASEP conditioned on a low current. In From particle systems to partial differential equations: particle systems and PDEs, Braga, Portugal, December 2012. Berlin: Springer. doi:10.1007/978-3-642-54271-8_3
NLM
Belitsky V, Schutz GM. Shocks and antishocks in the ASEP conditioned on a low current [Internet]. From particle systems to partial differential equations: particle systems and PDEs, Braga, Portugal, December 2012. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-54271-8_3
Vancouver
Belitsky V, Schutz GM. Shocks and antishocks in the ASEP conditioned on a low current [Internet]. From particle systems to partial differential equations: particle systems and PDEs, Braga, Portugal, December 2012. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-54271-8_3
Trabalho de evento
Polynomial-time approximation schemes for circle packing problems (2014)
Miyazawa, Flavio Keidi; Pedrosa, Lehilton L. C; Schouery, Rafael Crivellari Saliba; Sviridenko, Maxim; Wakabayashi, Yoshiko
Fonte: Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. Nome do evento: European Symposium on Algorithms - ESA. Unidade: IME
Assuntos: COMPUTABILIDADE E COMPLEXIDADE, ANÁLISE DE ALGORITMOS, MATEMÁTICA DISCRETA, ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi et al. Polynomial-time approximation schemes for circle packing problems. 2014, Anais.. Berlin: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-662-44777-2_59. Acesso em: 18 out. 2024.
APA
Miyazawa, F. K., Pedrosa, L. L. C., Schouery, R. C. S., Sviridenko, M., & Wakabayashi, Y. (2014). Polynomial-time approximation schemes for circle packing problems. In Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. Berlin: Springer. doi:10.1007/978-3-662-44777-2_59
NLM
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle packing problems [Internet]. Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-662-44777-2_59
Vancouver
Miyazawa FK, Pedrosa LLC, Schouery RCS, Sviridenko M, Wakabayashi Y. Polynomial-time approximation schemes for circle packing problems [Internet]. Algorithms - ESA 2014: 22nd Annual European Symposium Wroclaw, Poland, September 8-10, 2014, Proceedings. 2014 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-662-44777-2_59
Parte de monografia/livro
An unstable hypergraph problem with a unique optimal solution (2013)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lefmann, Hanno
Fonte: Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos e KOHAYAKAWA, Yoshiharu e LEFMANN, Hanno. An unstable hypergraph problem with a unique optimal solution. Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Tradução . Berlin: Springer, 2013. . Disponível em: https://doi.org/10.1007/978-3-642-36899-8_20. Acesso em: 18 out. 2024.
APA
Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2013). An unstable hypergraph problem with a unique optimal solution. In Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Berlin: Springer. doi:10.1007/978-3-642-36899-8_20
NLM
Hoppen C, Kohayakawa Y, Lefmann H. An unstable hypergraph problem with a unique optimal solution [Internet]. In: Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Berlin: Springer; 2013. [citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-36899-8_20
Vancouver
Hoppen C, Kohayakawa Y, Lefmann H. An unstable hypergraph problem with a unique optimal solution [Internet]. In: Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Berlin: Springer; 2013. [citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-36899-8_20
Trabalho de evento
Image segmentation by oriented image foresting transform with geodesic star convexity (2013)
Mansilla, Lucy Alsina Choque ; Miranda, Paulo André Vechiatto de
Fonte: Proceedings. Nome do evento: International Conference on Computer Analysis of Images and Patterns - CAIP. Unidade: IME
Assunto: PROCESSAMENTO DE IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MANSILLA, Lucy Alsina Choque e MIRANDA, Paulo André Vechiatto de. Image segmentation by oriented image foresting transform with geodesic star convexity. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-40261-6_69. Acesso em: 18 out. 2024.
APA
Mansilla, L. A. C., & Miranda, P. A. V. de. (2013). Image segmentation by oriented image foresting transform with geodesic star convexity. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-40261-6_69
NLM
Mansilla LAC, Miranda PAV de. Image segmentation by oriented image foresting transform with geodesic star convexity [Internet]. Proceedings. 2013 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-40261-6_69
Vancouver
Mansilla LAC, Miranda PAV de. Image segmentation by oriented image foresting transform with geodesic star convexity [Internet]. Proceedings. 2013 ;[citado 2024 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-40261-6_69
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: 18 out. 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 out. 18 ] 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 out. 18 ] Available from: https://doi.org/10.1007/978-3-642-38294-9_5

Unidades USP

ReP

Filtros

Tipo de material

Departamento

Autores

Autores USP

Ano de publicação

Assuntos

Título da fonte

Nome do evento

Agência de fomento

Afiliação dos autores externos normalizada

Afiliação dos autores externos não normalizada

País das instituições de afiliação dos autores externos