ReP USP - Resultado da busca

Artigo de periodico
Estimating the effects of urban green regions in terms of diffusion (2023)
Tokuda, Eric Keiji ; Arruda, Henrique Ferraz de ; Domingues, Guilherme Schimidt ; Costa, Luciano da Fontoura ; Shibata, Florence Alyssa Sakuma ; Cesar Junior, Roberto Marcondes ; Comin, Cesar Henrique
Source: Environment and Planning B: urban analytics and city science. Unidades: IME, IFSC
Subjects: ESPAÇOS VERDES, PROCESSOS DE DIFUSÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOKUDA, Eric Keiji et al. Estimating the effects of urban green regions in terms of diffusion. Environment and Planning B: urban analytics and city science, v. 50, n. 4, p. 1023-1038, 2023Tradução . . Disponível em: https://doi.org/10.1177/23998083221131572. Acesso em: 12 jun. 2024.
APA
Tokuda, E. K., Arruda, H. F. de, Domingues, G. S., Costa, L. da F., Shibata, F. A. S., Cesar Junior, R. M., & Comin, C. H. (2023). Estimating the effects of urban green regions in terms of diffusion. Environment and Planning B: urban analytics and city science, 50( 4), 1023-1038. doi:10.1177/23998083221131572
NLM
Tokuda EK, Arruda HF de, Domingues GS, Costa L da F, Shibata FAS, Cesar Junior RM, Comin CH. Estimating the effects of urban green regions in terms of diffusion [Internet]. Environment and Planning B: urban analytics and city science. 2023 ; 50( 4): 1023-1038.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1177/23998083221131572
Vancouver
Tokuda EK, Arruda HF de, Domingues GS, Costa L da F, Shibata FAS, Cesar Junior RM, Comin CH. Estimating the effects of urban green regions in terms of diffusion [Internet]. Environment and Planning B: urban analytics and city science. 2023 ; 50( 4): 1023-1038.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1177/23998083221131572
Artigo de periodico
Automatic detection of the parasite Trypanosoma cruzi in blood smears using a machine learning approach applied to mobile phone images (2022)
Morais, Mauro César Cafundó ; Silva, Diogo; Milagre, Matheus Marques; Oliveira, Maykon Tavares de; Pereira, Thaís; Silva, João Santana da ; Costa, Luciano da Fontoura ; Minóprio, Paola ; César Júnior, Roberto Marcondes ; Gazzinelli, Ricardo; Lana, Marta de; Nakaya, Helder Takashi Imoto
Source: PeerJ. Unidades: IFSC, IME, FCF, FMRP
Subjects: APRENDIZADO COMPUTACIONAL, TRYPANOSOMA CRUZI, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MORAIS, Mauro César Cafundó et al. Automatic detection of the parasite Trypanosoma cruzi in blood smears using a machine learning approach applied to mobile phone images. PeerJ, v. 10, p. e13470-1-e13470-19, 2022Tradução . . Disponível em: https://doi.org/10.7717/peerj.13470. Acesso em: 12 jun. 2024.
APA
Morais, M. C. C., Silva, D., Milagre, M. M., Oliveira, M. T. de, Pereira, T., Silva, J. S. da, et al. (2022). Automatic detection of the parasite Trypanosoma cruzi in blood smears using a machine learning approach applied to mobile phone images. PeerJ, 10, e13470-1-e13470-19. doi:10.7717/peerj.13470
NLM
Morais MCC, Silva D, Milagre MM, Oliveira MT de, Pereira T, Silva JS da, Costa L da F, Minóprio P, César Júnior RM, Gazzinelli R, Lana M de, Nakaya HTI. Automatic detection of the parasite Trypanosoma cruzi in blood smears using a machine learning approach applied to mobile phone images [Internet]. PeerJ. 2022 ; 10 e13470-1-e13470-19.[citado 2024 jun. 12 ] Available from: https://doi.org/10.7717/peerj.13470
Vancouver
Morais MCC, Silva D, Milagre MM, Oliveira MT de, Pereira T, Silva JS da, Costa L da F, Minóprio P, César Júnior RM, Gazzinelli R, Lana M de, Nakaya HTI. Automatic detection of the parasite Trypanosoma cruzi in blood smears using a machine learning approach applied to mobile phone images [Internet]. PeerJ. 2022 ; 10 e13470-1-e13470-19.[citado 2024 jun. 12 ] Available from: https://doi.org/10.7717/peerj.13470
Artigo de periodico
Spatial distribution of graffiti types: a complex network approach (2021)
Tokuda, Eric Keiji ; Arruda, Henrique Ferraz de ; Comin, Cesar Henrique ; César Júnior, Roberto Marcondes ; Silva, Claudio Teixeira ; Costa, Luciano da Fontoura
Source: European Physical Journal B. Unidades: IME, IFSC
Subjects: DISTRIBUIÇÃO ESPACIAL, REDES COMPLEXAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOKUDA, Eric Keiji et al. Spatial distribution of graffiti types: a complex network approach. European Physical Journal B, v. 94, n. 9, p. 192-1-192-8, 2021Tradução . . Disponível em: https://doi.org/10.1140/epjb/s10051-021-00202-y. Acesso em: 12 jun. 2024.
APA
Tokuda, E. K., Arruda, H. F. de, Comin, C. H., César Júnior, R. M., Silva, C. T., & Costa, L. da F. (2021). Spatial distribution of graffiti types: a complex network approach. European Physical Journal B, 94( 9), 192-1-192-8. doi:10.1140/epjb/s10051-021-00202-y
NLM
Tokuda EK, Arruda HF de, Comin CH, César Júnior RM, Silva CT, Costa L da F. Spatial distribution of graffiti types: a complex network approach [Internet]. European Physical Journal B. 2021 ; 94( 9): 192-1-192-8.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1140/epjb/s10051-021-00202-y
Vancouver
Tokuda EK, Arruda HF de, Comin CH, César Júnior RM, Silva CT, Costa L da F. Spatial distribution of graffiti types: a complex network approach [Internet]. European Physical Journal B. 2021 ; 94( 9): 192-1-192-8.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1140/epjb/s10051-021-00202-y
Artigo de periodico
Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (2020)
Birgin, Ernesto Julian Goldberg ; Krejić, Nataša ; Martínez, José Mário
Source: Mathematics of Computation. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e KREJIĆ, Nataša e MARTÍNEZ, José Mário. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, v. 89, p. 253-278, 2020Tradução . . Disponível em: https://doi.org/10.1090/mcom/3445. Acesso em: 12 jun. 2024.
APA
Birgin, E. J. G., Krejić, N., & Martínez, J. M. (2020). Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact. Mathematics of Computation, 89, 253-278. doi:10.1090/mcom/3445
NLM
Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1090/mcom/3445
Vancouver
Birgin EJG, Krejić N, Martínez JM. Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact [Internet]. Mathematics of Computation. 2020 ; 89 253-278.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1090/mcom/3445
Artigo de periodico
Design and evaluation of a scalable smart city software platform with large-scale simulations (2019)
Del Esposte, Arthur de Moura ; Santana, Eduardo Felipe Zambom; Kanashiro, Lucas; Costa, Fabio M ; Braghetto, Kelly Rosa ; Lago, Nelson ; Kon, Fabio.
Source: Future Generation Computer Systems. Unidades: IME, EACH
Subjects: CIDADES INTELIGENTES, INOVAÇÕES TECNOLÓGICAS, MIDDLEWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DEL ESPOSTE, Arthur de Moura et al. Design and evaluation of a scalable smart city software platform with large-scale simulations. Future Generation Computer Systems, v. 93, p. 427-441, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.future.2018.10.026. Acesso em: 12 jun. 2024.
APA
Del Esposte, A. de M., Santana, E. F. Z., Kanashiro, L., Costa, F. M., Braghetto, K. R., Lago, N., & Kon, F. (2019). Design and evaluation of a scalable smart city software platform with large-scale simulations. Future Generation Computer Systems, 93, 427-441. doi:10.1016/j.future.2018.10.026
NLM
Del Esposte A de M, Santana EFZ, Kanashiro L, Costa FM, Braghetto KR, Lago N, Kon F. Design and evaluation of a scalable smart city software platform with large-scale simulations [Internet]. Future Generation Computer Systems. 2019 ; 93 427-441.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.future.2018.10.026
Vancouver
Del Esposte A de M, Santana EFZ, Kanashiro L, Costa FM, Braghetto KR, Lago N, Kon F. Design and evaluation of a scalable smart city software platform with large-scale simulations [Internet]. Future Generation Computer Systems. 2019 ; 93 427-441.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.future.2018.10.026
Artigo de periodico
A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids (2019)
Birgin, Ernesto Julian Goldberg ; Lobato, Rafael Durbano
Source: European Journal of Operational Research. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e LOBATO, Rafael Durbano. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, v. 272, n. 2, p. 447-464, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2018.07.006. Acesso em: 12 jun. 2024.
APA
Birgin, E. J. G., & Lobato, R. D. (2019). A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids. European Journal of Operational Research, 272( 2), 447-464. doi:10.1016/j.ejor.2018.07.006
NLM
Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
Vancouver
Birgin EJG, Lobato RD. A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids [Internet]. European Journal of Operational Research. 2019 ; 272( 2): 447-464.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.ejor.2018.07.006
Artigo de periodico
Morphological neuron classification based on dendritic tree hierarchy (2019)
Cervantes, Evelyn Perez ; Comin, Cesar H. ; César Júnior, Roberto Marcondes ; Costa, Luciano da Fontoura
Source: Neuroinformatics. Unidades: IME, IFSC
Subjects: COMPUTAÇÃO APLICADA, BIOINFORMÁTICA, VISÃO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CERVANTES, Evelyn Perez et al. Morphological neuron classification based on dendritic tree hierarchy. Neuroinformatics, v. 17, n. Ja 2019, p. 147-161, 2019Tradução . . Disponível em: https://doi.org/10.1007/s12021-018-9388-7. Acesso em: 12 jun. 2024.
APA
Cervantes, E. P., Comin, C. H., César Júnior, R. M., & Costa, L. da F. (2019). Morphological neuron classification based on dendritic tree hierarchy. Neuroinformatics, 17( Ja 2019), 147-161. doi:10.1007/s12021-018-9388-7
NLM
Cervantes EP, Comin CH, César Júnior RM, Costa L da F. Morphological neuron classification based on dendritic tree hierarchy [Internet]. Neuroinformatics. 2019 ; 17( Ja 2019): 147-161.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/s12021-018-9388-7
Vancouver
Cervantes EP, Comin CH, César Júnior RM, Costa L da F. Morphological neuron classification based on dendritic tree hierarchy [Internet]. Neuroinformatics. 2019 ; 17( Ja 2019): 147-161.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1007/s12021-018-9388-7
Artigo de periodico
Monochromatic trees in random graphs (2019)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias
Source: Mathematical Proceedings of the Cambridge Philosophical Society. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e MOTA, Guilherme Oliveira e SCHACHT, Mathias. Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, v. 166, n. 1, p. 191-208, 2019Tradução . . Disponível em: https://doi.org/10.1017/S0305004117000846. Acesso em: 12 jun. 2024.
APA
Kohayakawa, Y., Mota, G. O., & Schacht, M. (2019). Monochromatic trees in random graphs. Mathematical Proceedings of the Cambridge Philosophical Society, 166( 1), 191-208. doi:10.1017/S0305004117000846
NLM
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1017/S0305004117000846
Vancouver
Kohayakawa Y, Mota GO, Schacht M. Monochromatic trees in random graphs [Internet]. Mathematical Proceedings of the Cambridge Philosophical Society. 2019 ; 166( 1): 191-208.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1017/S0305004117000846
Artigo de periodico
Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome (2019)
Bando, Sílvia Yumi ; Iamashita, Priscila ; Silva, Filipi Nascimento ; Costa, Luciano da Fontoura ; Abe, Cecília M. ; Bertonha, Fernanda Bernardi ; Guth, Beatriz E. C. ; Fujita, André ; Moreira-Filho, Carlos Alberto
Source: Microorganisms. Unidades: FM, IFSC, IME
Subjects: ESCHERICHIA COLI, EXPRESSÃO GÊNICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BANDO, Sílvia Yumi et al. Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome. Microorganisms, v. 7, n. 7, p. 195-1-195-23, 2019Tradução . . Disponível em: https://doi.org/10.3390/microorganisms7070195. Acesso em: 12 jun. 2024.
APA
Bando, S. Y., Iamashita, P., Silva, F. N., Costa, L. da F., Abe, C. M., Bertonha, F. B., et al. (2019). Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome. Microorganisms, 7( 7), 195-1-195-23. doi:10.3390/microorganisms7070195
NLM
Bando SY, Iamashita P, Silva FN, Costa L da F, Abe CM, Bertonha FB, Guth BEC, Fujita A, Moreira-Filho CA. Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome [Internet]. Microorganisms. 2019 ; 7( 7): 195-1-195-23.[citado 2024 jun. 12 ] Available from: https://doi.org/10.3390/microorganisms7070195
Vancouver
Bando SY, Iamashita P, Silva FN, Costa L da F, Abe CM, Bertonha FB, Guth BEC, Fujita A, Moreira-Filho CA. Dynamic gene network analysis of caco-2 cell response to shiga toxin-producing Escherichia coli-associated hemolytic-uremic syndrome [Internet]. Microorganisms. 2019 ; 7( 7): 195-1-195-23.[citado 2024 jun. 12 ] Available from: https://doi.org/10.3390/microorganisms7070195
Artigo de periodico
Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry (2018)
Caluza Machado, Fabrício; Oliveira Filho, Fernando Mário de
Source: Experimental Mathematics. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALUZA MACHADO, Fabrício e OLIVEIRA FILHO, Fernando Mário de. Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry. Experimental Mathematics, v. 27, n. 3, p. 362-369, 2018Tradução . . Disponível em: https://doi.org/10.1080/10586458.2017.1286273. Acesso em: 12 jun. 2024.
APA
Caluza Machado, F., & Oliveira Filho, F. M. de. (2018). Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry. Experimental Mathematics, 27( 3), 362-369. doi:10.1080/10586458.2017.1286273
NLM
Caluza Machado F, Oliveira Filho FM de. Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry [Internet]. Experimental Mathematics. 2018 ; 27( 3): 362-369.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1080/10586458.2017.1286273
Vancouver
Caluza Machado F, Oliveira Filho FM de. Improving the semidefinite programming bound for the kissing number by exploiting polynomial symmetry [Internet]. Experimental Mathematics. 2018 ; 27( 3): 362-369.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1080/10586458.2017.1286273
Artigo de periodico
Scalable object instance recognition based on keygraph matching (2018)
Dazzi, Estephan; Campos, Teófilo de; Hilton, Adrian; César Júnior, Roberto Marcondes
Source: Pattern Recognition Letters. Unidade: IME
Subjects: INTERPOLAÇÃO, APROXIMAÇÃO POR POLINÔMIOS, GEOMETRIA COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DAZZI, Estephan et al. Scalable object instance recognition based on keygraph matching. Pattern Recognition Letters, v. 114, p. 53-62, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2017.10.038. Acesso em: 12 jun. 2024.
APA
Dazzi, E., Campos, T. de, Hilton, A., & César Júnior, R. M. (2018). Scalable object instance recognition based on keygraph matching. Pattern Recognition Letters, 114, 53-62. doi:10.1016/j.patrec.2017.10.038
NLM
Dazzi E, Campos T de, Hilton A, César Júnior RM. Scalable object instance recognition based on keygraph matching [Internet]. Pattern Recognition Letters. 2018 ; 114 53-62.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.patrec.2017.10.038
Vancouver
Dazzi E, Campos T de, Hilton A, César Júnior RM. Scalable object instance recognition based on keygraph matching [Internet]. Pattern Recognition Letters. 2018 ; 114 53-62.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.patrec.2017.10.038
Artigo de periodico
Uncovering association networks through an eQTL analysis involving human miRNAs and lincRNAs (2018)
Branco, Paulo R; Araújo, Gilderlanio S. de; Barrera, Júnior; Suarez-Kurtz, Guilherme; Souza, Sandro José de
Source: Scientific Reports. Unidade: IME
Assunto: BIOINFORMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BRANCO, Paulo R et al. Uncovering association networks through an eQTL analysis involving human miRNAs and lincRNAs. Scientific Reports, v. 8, p. 15050-1-15050-10, 2018Tradução . . Disponível em: https://doi.org/10.1038/s41598-018-33420-z. Acesso em: 12 jun. 2024.
APA
Branco, P. R., Araújo, G. S. de, Barrera, J., Suarez-Kurtz, G., & Souza, S. J. de. (2018). Uncovering association networks through an eQTL analysis involving human miRNAs and lincRNAs. Scientific Reports, 8, 15050-1-15050-10. doi:10.1038/s41598-018-33420-z
NLM
Branco PR, Araújo GS de, Barrera J, Suarez-Kurtz G, Souza SJ de. Uncovering association networks through an eQTL analysis involving human miRNAs and lincRNAs [Internet]. Scientific Reports. 2018 ; 8 15050-1-15050-10.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1038/s41598-018-33420-z
Vancouver
Branco PR, Araújo GS de, Barrera J, Suarez-Kurtz G, Souza SJ de. Uncovering association networks through an eQTL analysis involving human miRNAs and lincRNAs [Internet]. Scientific Reports. 2018 ; 8 15050-1-15050-10.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1038/s41598-018-33420-z
Trabalho de evento-anais periodico
Decomposing highly connected graphs into paths of length five (2018)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Conference titles: Latin American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2016.08.001. Acesso em: 12 jun. 2024. , 2018
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2018). Decomposing highly connected graphs into paths of length five. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2016.08.001
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.dam.2016.08.001
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly connected graphs into paths of length five [Internet]. Discrete Applied Mathematics. 2018 ; 245 128-138.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1016/j.dam.2016.08.001
Trabalho de evento-anais periodico
Feature selection based on the Local Lift Dependence scale (2018)
Marcondes, Diego; Simonis, Adilson ; Barrera, Júnior
Source: Entropy. Conference titles: International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering - MaxEnt 2017. Unidade: IME
Assunto: INFERÊNCIA BAYESIANA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARCONDES, Diego e SIMONIS, Adilson e BARRERA, Júnior. Feature selection based on the Local Lift Dependence scale. Entropy. Basel: MDPI. Disponível em: https://doi.org/10.3390/e20020097. Acesso em: 12 jun. 2024. , 2018
APA
Marcondes, D., Simonis, A., & Barrera, J. (2018). Feature selection based on the Local Lift Dependence scale. Entropy. Basel: MDPI. doi:10.3390/e20020097
NLM
Marcondes D, Simonis A, Barrera J. Feature selection based on the Local Lift Dependence scale [Internet]. Entropy. 2018 ; 20( 2): 1-20.[citado 2024 jun. 12 ] Available from: https://doi.org/10.3390/e20020097
Vancouver
Marcondes D, Simonis A, Barrera J. Feature selection based on the Local Lift Dependence scale [Internet]. Entropy. 2018 ; 20( 2): 1-20.[citado 2024 jun. 12 ] Available from: https://doi.org/10.3390/e20020097
Artigo de periodico
Infinite Sidon sets contained in sparse random sets of integers (2018)
Kohayakawa, Yoshiharu ; Lee, Sang June; Moreira, Carlos Gustavo; Rödl, Vojtěch
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Assunto: TEORIA DOS NÚMEROS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Infinite Sidon sets contained in sparse random sets of integers. SIAM Journal on Discrete Mathematics, v. 32, n. 1, p. 410-449, 2018Tradução . . Disponível em: https://doi.org/10.1137/17M1114934. Acesso em: 12 jun. 2024.
APA
Kohayakawa, Y., Lee, S. J., Moreira, C. G., & Rödl, V. (2018). Infinite Sidon sets contained in sparse random sets of integers. SIAM Journal on Discrete Mathematics, 32( 1), 410-449. doi:10.1137/17M1114934
NLM
Kohayakawa Y, Lee SJ, Moreira CG, Rödl V. Infinite Sidon sets contained in sparse random sets of integers [Internet]. SIAM Journal on Discrete Mathematics. 2018 ; 32( 1): 410-449.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1137/17M1114934
Vancouver
Kohayakawa Y, Lee SJ, Moreira CG, Rödl V. Infinite Sidon sets contained in sparse random sets of integers [Internet]. SIAM Journal on Discrete Mathematics. 2018 ; 32( 1): 410-449.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1137/17M1114934
Artigo de periodico
The number of Bh-sets of a given cardinality (2018)
Dellamonica, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rödl, Vojtěch; Samotij, Wojciech
Source: Proceedings of the London Mathematical Society. Unidade: IME
Subjects: TEORIA DOS NÚMEROS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA, Domingos et al. The number of Bh-sets of a given cardinality. Proceedings of the London Mathematical Society, v. 116, n. 3, p. 629-669, 2018Tradução . . Disponível em: https://doi.org/10.1112/plms.12082. Acesso em: 12 jun. 2024.
APA
Dellamonica, D., Kohayakawa, Y., Lee, S. J., Rödl, V., & Samotij, W. (2018). The number of Bh-sets of a given cardinality. Proceedings of the London Mathematical Society, 116( 3), 629-669. doi:10.1112/plms.12082
NLM
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of Bh-sets of a given cardinality [Internet]. Proceedings of the London Mathematical Society. 2018 ; 116( 3): 629-669.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1112/plms.12082
Vancouver
Dellamonica D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of Bh-sets of a given cardinality [Internet]. Proceedings of the London Mathematical Society. 2018 ; 116( 3): 629-669.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1112/plms.12082
Artigo de periodico
Complex network measures in autism spectrum disorders (2018)
Sato, João Ricardo ; Vidal, Maciel Calebe ; Santos, Suzana de Siqueira ; Massirer, Katlin Brauer ; Fujita, André
Source: IEEE - ACM Transactions on Computational Biology and Bioinformatics. Unidade: IME
Subjects: BIOINFORMÁTICA, REDES COMPLEXAS, AUTISMO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SATO, João Ricardo et al. Complex network measures in autism spectrum disorders. IEEE - ACM Transactions on Computational Biology and Bioinformatics, v. 15, n. 2, p. 581 - 587, 2018Tradução . . Disponível em: https://doi.org/10.1109/TCBB.2015.2476787. Acesso em: 12 jun. 2024.
APA
Sato, J. R., Vidal, M. C., Santos, S. de S., Massirer, K. B., & Fujita, A. (2018). Complex network measures in autism spectrum disorders. IEEE - ACM Transactions on Computational Biology and Bioinformatics, 15( 2), 581 - 587. doi:10.1109/TCBB.2015.2476787
NLM
Sato JR, Vidal MC, Santos S de S, Massirer KB, Fujita A. Complex network measures in autism spectrum disorders [Internet]. IEEE - ACM Transactions on Computational Biology and Bioinformatics. 2018 ; 15( 2): 581 - 587.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1109/TCBB.2015.2476787
Vancouver
Sato JR, Vidal MC, Santos S de S, Massirer KB, Fujita A. Complex network measures in autism spectrum disorders [Internet]. IEEE - ACM Transactions on Computational Biology and Bioinformatics. 2018 ; 15( 2): 581 - 587.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1109/TCBB.2015.2476787
Artigo de periodico
On regularization and active-set methods with complexity for constrained optimization (2018)
Birgin, Ernesto Julian Goldberg ; Martinez, J M
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO MATEMÁTICA, COMPUTABILIDADE E COMPLEXIDADE, ANÁLISE DE ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, J M. On regularization and active-set methods with complexity for constrained optimization. SIAM Journal on Optimization, v. 28, n. 2, p. 1367-1395, 2018Tradução . . Disponível em: https://doi.org/10.1137/17M1127107. Acesso em: 12 jun. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2018). On regularization and active-set methods with complexity for constrained optimization. SIAM Journal on Optimization, 28( 2), 1367-1395. doi:10.1137/17M1127107
NLM
Birgin EJG, Martinez JM. On regularization and active-set methods with complexity for constrained optimization [Internet]. SIAM Journal on Optimization. 2018 ; 28( 2): 1367-1395.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1137/17M1127107
Vancouver
Birgin EJG, Martinez JM. On regularization and active-set methods with complexity for constrained optimization [Internet]. SIAM Journal on Optimization. 2018 ; 28( 2): 1367-1395.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1137/17M1127107
Artigo de periodico
On an anti-Ramsey threshold for sparse graphs with one triangle (2018)
Kohayakawa, Yoshiharu ; Konstadinidis, Pavlos Bahia; Mota, Guilherme Oliveira
Source: Journal of Graph Theory. Unidade: IME
Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e KONSTADINIDIS, Pavlos Bahia e MOTA, Guilherme Oliveira. On an anti-Ramsey threshold for sparse graphs with one triangle. Journal of Graph Theory, v. 87, n. 2, p. 176-187, 2018Tradução . . Disponível em: https://doi.org/10.1002/jgt.22150. Acesso em: 12 jun. 2024.
APA
Kohayakawa, Y., Konstadinidis, P. B., & Mota, G. O. (2018). On an anti-Ramsey threshold for sparse graphs with one triangle. Journal of Graph Theory, 87( 2), 176-187. doi:10.1002/jgt.22150
NLM
Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for sparse graphs with one triangle [Internet]. Journal of Graph Theory. 2018 ; 87( 2): 176-187.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1002/jgt.22150
Vancouver
Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for sparse graphs with one triangle [Internet]. Journal of Graph Theory. 2018 ; 87( 2): 176-187.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1002/jgt.22150
Artigo de periodico
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors (2018)
Birgin, Ernesto Julian Goldberg ; Krejic, N; Martínez, J. M
Source: Mathematics of Computation. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, MÉTODOS NUMÉRICOS DE OTIMIZAÇÃO, PROGRAMAÇÃO NÃO LINEAR, PROGRAMAÇÃO ESTOCÁSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e KREJIC, N e MARTÍNEZ, J. M. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Mathematics of Computation, v. 87, n. 311, p. 1307-1326, 2018Tradução . . Disponível em: https://doi.org/10.1090/mcom/3246. Acesso em: 12 jun. 2024.
APA
Birgin, E. J. G., Krejic, N., & Martínez, J. M. (2018). On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors. Mathematics of Computation, 87( 311), 1307-1326. doi:10.1090/mcom/3246
NLM
Birgin EJG, Krejic N, Martínez JM. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors [Internet]. Mathematics of Computation. 2018 ; 87( 311): 1307-1326.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1090/mcom/3246
Vancouver
Birgin EJG, Krejic N, Martínez JM. On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors [Internet]. Mathematics of Computation. 2018 ; 87( 311): 1307-1326.[citado 2024 jun. 12 ] Available from: https://doi.org/10.1090/mcom/3246

USP Schools

ReP

Filtros

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Countries/Territories

Grupo de pesquisa

Funding Agencies

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration