ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Generalizing and unifying gray-box combinatorial optimization operators (2024)
Chicano, Francisco; Whitley, Darrell; Ochoa, Gabriela; Tinós, Renato
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Parallel Problem Solving from Nature (PPSN). Unidade: FFCLRP
Subjects: MATEMÁTICA, OPERADORES, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHICANO, Francisco et al. Generalizing and unifying gray-box combinatorial optimization operators. Lecture Notes in Computer Science. Hagenberg: Springer International Publishing. Disponível em: https://doi.org/10.1007/978-3-031-70055-2_4. Acesso em: 23 dez. 2025. , 2024
APA
Chicano, F., Whitley, D., Ochoa, G., & Tinós, R. (2024). Generalizing and unifying gray-box combinatorial optimization operators. Lecture Notes in Computer Science. Hagenberg: Springer International Publishing. doi:10.1007/978-3-031-70055-2_4
NLM
Chicano F, Whitley D, Ochoa G, Tinós R. Generalizing and unifying gray-box combinatorial optimization operators [Internet]. Lecture Notes in Computer Science. 2024 ; 15148 52–67.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-031-70055-2_4
Vancouver
Chicano F, Whitley D, Ochoa G, Tinós R. Generalizing and unifying gray-box combinatorial optimization operators [Internet]. Lecture Notes in Computer Science. 2024 ; 15148 52–67.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-031-70055-2_4
Trabalho de evento-anais periodico
Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes (2023)
Silva, Maísa de Carvalho; Pereira, Paulo Guilherme Pinheiro; Oliveira, Lariza Laura de ; Tinós, Renato
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA, CÓDIGO GENÉTICO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Maísa de Carvalho et al. Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes. Lecture Notes in Computer Science. Belo Horizonte: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-031-45392-2_1. Acesso em: 23 dez. 2025. , 2023
APA
Silva, M. de C., Pereira, P. G. P., Oliveira, L. L. de, & Tinós, R. (2023). Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes. Lecture Notes in Computer Science. Belo Horizonte: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. doi:10.1007/978-3-031-45392-2_1
NLM
Silva M de C, Pereira PGP, Oliveira LL de, Tinós R. Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes [Internet]. Lecture Notes in Computer Science. 2023 ; 14197 3-16.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-031-45392-2_1
Vancouver
Silva M de C, Pereira PGP, Oliveira LL de, Tinós R. Multiobjective evolutionary algorithms applied to the optimization of expanded genetic codes [Internet]. Lecture Notes in Computer Science. 2023 ; 14197 3-16.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-031-45392-2_1
Artigo de periodico
Detecting early signs of insufficiency in COVID-19 patients from CBC tests through a supervised learning approach (2021)
Colliri, Tiago; Minakawa, Marcia Michie; Liang, Zhao
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidades: FFCLRP, FSP
Subjects: REDES COMPLEXAS, COVID-19, PROGNÓSTICO, BIOMARCADORES, CONTAGEM DE CÉLULAS SANGUÍNEAS, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COLLIRI, Tiago e MINAKAWA, Marcia Michie e LIANG, Zhao. Detecting early signs of insufficiency in COVID-19 patients from CBC tests through a supervised learning approach. Lecture Notes in Computer Science, v. 13074, p. 42-57, 2021Tradução . . Disponível em: https://doi.org/10.1007/978-3-030-91699-2_4. Acesso em: 23 dez. 2025.
APA
Colliri, T., Minakawa, M. M., & Liang, Z. (2021). Detecting early signs of insufficiency in COVID-19 patients from CBC tests through a supervised learning approach. Lecture Notes in Computer Science, 13074, 42-57. doi:10.1007/978-3-030-91699-2_4
NLM
Colliri T, Minakawa MM, Liang Z. Detecting early signs of insufficiency in COVID-19 patients from CBC tests through a supervised learning approach [Internet]. Lecture Notes in Computer Science. 2021 ; 13074 42-57.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91699-2_4
Vancouver
Colliri T, Minakawa MM, Liang Z. Detecting early signs of insufficiency in COVID-19 patients from CBC tests through a supervised learning approach [Internet]. Lecture Notes in Computer Science. 2021 ; 13074 42-57.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91699-2_4
Trabalho de evento-anais periodico
A graph-based crossover and soft-repair operators for the steiner tree problem (2021)
Godoi, Giliard Almeida de; Tinós, Renato ; Sanches, Danilo Sipoli
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: FFCLRP
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GODOI, Giliard Almeida de e TINÓS, Renato e SANCHES, Danilo Sipoli. A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-91702-9_8. Acesso em: 23 dez. 2025. , 2021
APA
Godoi, G. A. de, Tinós, R., & Sanches, D. S. (2021). A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-91702-9_8
NLM
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8
Vancouver
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8
Artigo de periodico
Coarsening algorithm via semi-synchronous label propagation for bipartite networks (2021)
Valejo, Alan Demétrius Baria; Althoff, Paulo Eduardo; Faleiros, Thiago de Paulo; Chuerubim, Maria Lígia; Yan, Jianglong; Liu, Weiguang; Liang, Zhao
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: FFCLRP
Subjects: REDES COMPLEXAS, ANÁLISE MULTINÍVEL, ESTATÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VALEJO, Alan Demétrius Baria et al. Coarsening algorithm via semi-synchronous label propagation for bipartite networks. Lecture Notes in Computer Science, v. 13073, p. 437-452, 2021Tradução . . Disponível em: https://doi.org/10.1007/978-3-030-91702-9_29. Acesso em: 23 dez. 2025.
APA
Valejo, A. D. B., Althoff, P. E., Faleiros, T. de P., Chuerubim, M. L., Yan, J., Liu, W., & Liang, Z. (2021). Coarsening algorithm via semi-synchronous label propagation for bipartite networks. Lecture Notes in Computer Science, 13073, 437-452. doi:10.1007/978-3-030-91702-9_29
NLM
Valejo ADB, Althoff PE, Faleiros T de P, Chuerubim ML, Yan J, Liu W, Liang Z. Coarsening algorithm via semi-synchronous label propagation for bipartite networks [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 437-452.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_29
Vancouver
Valejo ADB, Althoff PE, Faleiros T de P, Chuerubim ML, Yan J, Liu W, Liang Z. Coarsening algorithm via semi-synchronous label propagation for bipartite networks [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 437-452.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_29
Artigo de periodico
Anomaly detection in Brazilian Federal Government purchase cards through unsupervised learning techniques (2021)
Nunes, Breno; Colliri, Tiago; Lauretto, Marcelo de Souza ; Liu, Weiguang; Liang, Zhao
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidades: EACH, FFCLRP
Subjects: REDES COMPLEXAS, APRENDIZADO COMPUTACIONAL, CARTÃO MAGNÉTICO, PADRÕES DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NUNES, Breno et al. Anomaly detection in Brazilian Federal Government purchase cards through unsupervised learning techniques. Lecture Notes in Computer Science, v. 13074, p. 19-32, 2021Tradução . . Disponível em: https://doi.org/10.1007/978-3-030-91699-2_2. Acesso em: 23 dez. 2025.
APA
Nunes, B., Colliri, T., Lauretto, M. de S., Liu, W., & Liang, Z. (2021). Anomaly detection in Brazilian Federal Government purchase cards through unsupervised learning techniques. Lecture Notes in Computer Science, 13074, 19-32. doi:10.1007/978-3-030-91699-2_2
NLM
Nunes B, Colliri T, Lauretto M de S, Liu W, Liang Z. Anomaly detection in Brazilian Federal Government purchase cards through unsupervised learning techniques [Internet]. Lecture Notes in Computer Science. 2021 ; 13074 19-32.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91699-2_2
Vancouver
Nunes B, Colliri T, Lauretto M de S, Liu W, Liang Z. Anomaly detection in Brazilian Federal Government purchase cards through unsupervised learning techniques [Internet]. Lecture Notes in Computer Science. 2021 ; 13074 19-32.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-91699-2_2
Trabalho de evento-anais periodico
Fake news detection on fake.br using hierarchical attention networks (2020)
Okano, Emerson Yoshiaki ; Liu, Zebin; Ji, Donghong; Ruiz, Evandro Eduardo Seron
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Computational Processing of the Portuguese Language - PROPOR. Unidade: FFCLRP
Subjects: REDES DE COMPUTADORES, APRENDIZADO COMPUTACIONAL, FAKE NEWS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
OKANO, Emerson Yoshiaki et al. Fake news detection on fake.br using hierarchical attention networks. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/978-3-030-41505-1_14. Acesso em: 23 dez. 2025. , 2020
APA
Okano, E. Y., Liu, Z., Ji, D., & Ruiz, E. E. S. (2020). Fake news detection on fake.br using hierarchical attention networks. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. doi:10.1007/978-3-030-41505-1_14
NLM
Okano EY, Liu Z, Ji D, Ruiz EES. Fake news detection on fake.br using hierarchical attention networks [Internet]. Lecture Notes in Computer Science. 2020 ; 12037 143-152.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-41505-1_14
Vancouver
Okano EY, Liu Z, Ji D, Ruiz EES. Fake news detection on fake.br using hierarchical attention networks [Internet]. Lecture Notes in Computer Science. 2020 ; 12037 143-152.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-41505-1_14
Trabalho de evento-anais periodico
Quasi-optimal recombination operator (2019)
Chicano, Francisco ; Ochoa, Gabriela ; Whitley, Darrell; Tinós, Renato
Source: Lecture Notes in Computer Science. Conference titles: European Conference on Evolutionary Computation in Combinatorial Optimization - EvoCOP. Unidade: FFCLRP
Subjects: OPERADORES, 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
CHICANO, Francisco et al. Quasi-optimal recombination operator. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-16711-0_9. Acesso em: 23 dez. 2025. , 2019
APA
Chicano, F., Ochoa, G., Whitley, D., & Tinós, R. (2019). Quasi-optimal recombination operator. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-16711-0_9
NLM
Chicano F, Ochoa G, Whitley D, Tinós R. Quasi-optimal recombination operator [Internet]. Lecture Notes in Computer Science. 2019 ; 11452 131-146.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-16711-0_9
Vancouver
Chicano F, Ochoa G, Whitley D, Tinós R. Quasi-optimal recombination operator [Internet]. Lecture Notes in Computer Science. 2019 ; 11452 131-146.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-030-16711-0_9
Trabalho de evento-anais periodico
Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic (2018)
Tinós, Renato ; Helsgaun, Keld; Whitley, Darrell
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Parallel Problem Solving from Nature (PPSN). Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO, CIÊNCIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato e HELSGAUN, Keld e WHITLEY, Darrell. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. Disponível em: https://doi.org/10.1007/978-3-319-99253-2_8. Acesso em: 23 dez. 2025. , 2018
APA
Tinós, R., Helsgaun, K., & Whitley, D. (2018). Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. doi:10.1007/978-3-319-99253-2_8
NLM
Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8
Vancouver
Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8
Trabalho de evento-anais periodico
Bias-guided random walk for network-based data classification (2013)
Cupertino, Thiago Henrique; Liang, Zhao
Source: Lecture Notes in Computer Science. Conference titles: International Symposium on Neural Networks : Advances in Neural Networks - ISNN. Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, COMPUTAÇÃO GRÁFICA, PROCESSAMENTO DE IMAGENS, SISTEMAS DINÂMICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CUPERTINO, Thiago Henrique e LIANG, Zhao. Bias-guided random walk for network-based data classification. Lecture Notes in Computer Science. Berlin: Springer-Verlag. Disponível em: https://doi.org/10.1007/978-3-642-39068-5_46. Acesso em: 23 dez. 2025. , 2013
APA
Cupertino, T. H., & Liang, Z. (2013). Bias-guided random walk for network-based data classification. Lecture Notes in Computer Science. Berlin: Springer-Verlag. doi:10.1007/978-3-642-39068-5_46
NLM
Cupertino TH, Liang Z. Bias-guided random walk for network-based data classification [Internet]. Lecture Notes in Computer Science. 2013 ; 7952 375-384.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-642-39068-5_46
Vancouver
Cupertino TH, Liang Z. Bias-guided random walk for network-based data classification [Internet]. Lecture Notes in Computer Science. 2013 ; 7952 375-384.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-642-39068-5_46
Trabalho de evento-anais periodico
Root attribute behavior within a random forest (2012)
Oshiro, Thais Mayumi; Baranauskas, José Augusto
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Intelligent Data Engineering and Automated Learning. Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
OSHIRO, Thais Mayumi e BARANAUSKAS, José Augusto. Root attribute behavior within a random forest. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. . Acesso em: 23 dez. 2025. , 2012
APA
Oshiro, T. M., & Baranauskas, J. A. (2012). Root attribute behavior within a random forest. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo.
NLM
Oshiro TM, Baranauskas JA. Root attribute behavior within a random forest. Lecture Notes in Computer Science. 2012 ; 7435 733-742.[citado 2025 dez. 23 ]
Vancouver
Oshiro TM, Baranauskas JA. Root attribute behavior within a random forest. Lecture Notes in Computer Science. 2012 ; 7435 733-742.[citado 2025 dez. 23 ]
Trabalho de evento-anais periodico
A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze (2012)
Costa, Ariadne de Andrade; Roque, Antônio Carlos; Morato, Sílvio; Tinós, Renato
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Intelligent Data Engineering and Automated Learning. Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, MODELOS ANIMAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COSTA, Ariadne de Andrade et al. A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo. . Acesso em: 23 dez. 2025. , 2012
APA
Costa, A. de A., Roque, A. C., Morato, S., & Tinós, R. (2012). A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. Heidelberg: Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto, Universidade de São Paulo.
NLM
Costa A de A, Roque AC, Morato S, Tinós R. A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. 2012 ; 7435 151-158.[citado 2025 dez. 23 ]
Vancouver
Costa A de A, Roque AC, Morato S, Tinós R. A model based on genetic algorithm for investigation of the behavior of rats in the elevated plus-maze. Lecture Notes in Computer Science. 2012 ; 7435 151-158.[citado 2025 dez. 23 ]
Trabalho de evento-anais periodico
Color texture analysis and classification: an agent approach based on partially self-avoiding deterministic walks (2010)
Backes, André Ricardo; Martinez, Alexandre Souto; Bruno, Odemir Martinez
Source: Lecture Notes in Computer Science. Conference titles: Iberoamerican Congress on Pattern Recognition - CIARP 2010. Unidades: FFCLRP, IFSC
Subjects: IMAGEM DIGITAL, ATRATORES, VISÃO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BACKES, André Ricardo e MARTINEZ, Alexandre Souto e BRUNO, Odemir Martinez. Color texture analysis and classification: an agent approach based on partially self-avoiding deterministic walks. Lecture Notes in Computer Science. Heidelberg: Springer. Disponível em: https://doi.org/10.1007/978-3-642-16687-7. Acesso em: 23 dez. 2025. , 2010
APA
Backes, A. R., Martinez, A. S., & Bruno, O. M. (2010). Color texture analysis and classification: an agent approach based on partially self-avoiding deterministic walks. Lecture Notes in Computer Science. Heidelberg: Springer. doi:10.1007/978-3-642-16687-7
NLM
Backes AR, Martinez AS, Bruno OM. Color texture analysis and classification: an agent approach based on partially self-avoiding deterministic walks [Internet]. Lecture Notes in Computer Science. 2010 ; 6419 6-13.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-642-16687-7
Vancouver
Backes AR, Martinez AS, Bruno OM. Color texture analysis and classification: an agent approach based on partially self-avoiding deterministic walks [Internet]. Lecture Notes in Computer Science. 2010 ; 6419 6-13.[citado 2025 dez. 23 ] Available from: https://doi.org/10.1007/978-3-642-16687-7
Artigo de periodico
Extraction of gastric electrical response activity from magnetogastrographic recordings by DCA (2007)
Estombelo-Montesco, C. A; Araújo, Dráulio Barros de; Roque, Antônio Carlos; Moraes, Eder Rezende; Barros, A. K.; Wakai, R. T.; Baffa, Oswaldo
Source: Lecture Notes in Computer Science. Unidade: FFCLRP
Subjects: RITMOS BIOLÓGICOS EM HUMANOS, DIAGNÓSTICO POR COMPUTADOR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ESTOMBELO-MONTESCO, C. A et al. Extraction of gastric electrical response activity from magnetogastrographic recordings by DCA. Lecture Notes in Computer Science, v. 4666, p. 585-592, 2007Tradução . . Acesso em: 23 dez. 2025.
APA
Estombelo-Montesco, C. A., Araújo, D. B. de, Roque, A. C., Moraes, E. R., Barros, A. K., Wakai, R. T., & Baffa, O. (2007). Extraction of gastric electrical response activity from magnetogastrographic recordings by DCA. Lecture Notes in Computer Science, 4666, 585-592.
NLM
Estombelo-Montesco CA, Araújo DB de, Roque AC, Moraes ER, Barros AK, Wakai RT, Baffa O. Extraction of gastric electrical response activity from magnetogastrographic recordings by DCA. Lecture Notes in Computer Science. 2007 ; 4666 585-592.[citado 2025 dez. 23 ]
Vancouver
Estombelo-Montesco CA, Araújo DB de, Roque AC, Moraes ER, Barros AK, Wakai RT, Baffa O. Extraction of gastric electrical response activity from magnetogastrographic recordings by DCA. Lecture Notes in Computer Science. 2007 ; 4666 585-592.[citado 2025 dez. 23 ]
Artigo de periodico
An image analysis methodology based on deterministic tourist walks (2006)
Campiteli, Mônica G.; Martinez, Alexandre Souto; Bruno, Odemir Martinez
Source: Lecture Notes in Computer Science. Unidades: FFCLRP, ICMC
Assunto: DIAGNÓSTICO POR IMAGEM
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPITELI, Mônica G. e MARTINEZ, Alexandre Souto e BRUNO, Odemir Martinez. An image analysis methodology based on deterministic tourist walks. Lecture Notes in Computer Science, v. 4140, p. 159-167, 2006Tradução . . Acesso em: 23 dez. 2025.
APA
Campiteli, M. G., Martinez, A. S., & Bruno, O. M. (2006). An image analysis methodology based on deterministic tourist walks. Lecture Notes in Computer Science, 4140, 159-167.
NLM
Campiteli MG, Martinez AS, Bruno OM. An image analysis methodology based on deterministic tourist walks. Lecture Notes in Computer Science. 2006 ; 4140 159-167.[citado 2025 dez. 23 ]
Vancouver
Campiteli MG, Martinez AS, Bruno OM. An image analysis methodology based on deterministic tourist walks. Lecture Notes in Computer Science. 2006 ; 4140 159-167.[citado 2025 dez. 23 ]
Artigo de periodico
Deterministic tourist walks as an image analysis methodology based (2006)
Backes, André Ricardo; Bruno, Odemir Martinez ; Campiteli, Mônica G.; Martinez, Alexandre Souto
Source: Lecture Notes in Computer Science. Unidades: ICMC, FFCLRP
Assunto: INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BACKES, André Ricardo et al. Deterministic tourist walks as an image analysis methodology based. Lecture Notes in Computer Science, v. 4225, p. 784-793, 2006Tradução . . Acesso em: 23 dez. 2025.
APA
Backes, A. R., Bruno, O. M., Campiteli, M. G., & Martinez, A. S. (2006). Deterministic tourist walks as an image analysis methodology based. Lecture Notes in Computer Science, 4225, 784-793.
NLM
Backes AR, Bruno OM, Campiteli MG, Martinez AS. Deterministic tourist walks as an image analysis methodology based. Lecture Notes in Computer Science. 2006 ; 4225 784-793.[citado 2025 dez. 23 ]
Vancouver
Backes AR, Bruno OM, Campiteli MG, Martinez AS. Deterministic tourist walks as an image analysis methodology based. Lecture Notes in Computer Science. 2006 ; 4225 784-793.[citado 2025 dez. 23 ]

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Date published

Subjects

Conference titles

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration