Menu

Filtros : "França" "Holanda" "IME-MAC" Limpar

Filtros

Refine with date range

  • 1

1 - 13 (13 records)

  • Artigo de periodico

    Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies (2020)

    Alves, Wonder Alexandre Luz ; Gobber, Charles F; Silva, Dênnis José da; Morimitsu, Alexandre; Hashimoto, Ronaldo Fumio ; Marcotegui, Beatriz

    Source: Pattern Recognition Letters. Unidade: IME

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

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

    • ABNT

      ALVES, Wonder Alexandre Luz et al. Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies. Pattern Recognition Letters, v. 133, p. 264-271, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.03.013. Acesso em: 15 set. 2024.

    • APA

      Alves, W. A. L., Gobber, C. F., Silva, D. J. da, Morimitsu, A., Hashimoto, R. F., & Marcotegui, B. (2020). Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies. Pattern Recognition Letters, 133, 264-271. doi:10.1016/j.patrec.2020.03.013

    • NLM

      Alves WAL, Gobber CF, Silva DJ da, Morimitsu A, Hashimoto RF, Marcotegui B. Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies [Internet]. Pattern Recognition Letters. 2020 ; 133 264-271.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.patrec.2020.03.013

    • Vancouver

      Alves WAL, Gobber CF, Silva DJ da, Morimitsu A, Hashimoto RF, Marcotegui B. Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies [Internet]. Pattern Recognition Letters. 2020 ; 133 264-271.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.patrec.2020.03.013

  • Artigo de periodico

    Efficient component-hypertree construction based on hierarchy of partitions (2020)

    Morimitsu, Alexandre; Passat, Nicolas ; Alves, Wonder Alexandre Luz ; Hashimoto, Ronaldo Fumio

    Source: Pattern Recognition Letters. Unidade: IME

    Subjects: PROCESSAMENTO DE IMAGENS, ALGORITMOS PARA IMAGENS

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

    • ABNT

      MORIMITSU, Alexandre et al. Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recognition Letters, v. 135, p. 30-37, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.02.032. Acesso em: 15 set. 2024.

    • APA

      Morimitsu, A., Passat, N., Alves, W. A. L., & Hashimoto, R. F. (2020). Efficient component-hypertree construction based on hierarchy of partitions. Pattern Recognition Letters, 135, 30-37. doi:10.1016/j.patrec.2020.02.032

    • NLM

      Morimitsu A, Passat N, Alves WAL, Hashimoto RF. Efficient component-hypertree construction based on hierarchy of partitions [Internet]. Pattern Recognition Letters. 2020 ; 135 30-37.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.032

    • Vancouver

      Morimitsu A, Passat N, Alves WAL, Hashimoto RF. Efficient component-hypertree construction based on hierarchy of partitions [Internet]. Pattern Recognition Letters. 2020 ; 135 30-37.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.patrec.2020.02.032

  • Trabalho de evento-anais periodico

    Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (2014)

    Acuña, Vicente; Ferreira, Carlos Eduardo ; Freire, Alexandre S; Moreno, Eduardo

    Source: Discrete Applied Mathematics. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS, ALGORITMOS

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

    • ABNT

      ACUÑA, Vicente et al. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. 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.2011.09.019. Acesso em: 15 set. 2024. , 2014

    • APA

      Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2014). Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2011.09.019

    • NLM

      Acuña V, Ferreira CE, Freire AS, Moreno E. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs [Internet]. Discrete Applied Mathematics. 2014 ; 164 2-12.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.dam.2011.09.019

    • Vancouver

      Acuña V, Ferreira CE, Freire AS, Moreno E. Solving the maximum edge biclique packing problem on unbalanced bipartite graphs [Internet]. Discrete Applied Mathematics. 2014 ; 164 2-12.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.dam.2011.09.019

  • Trabalho de evento

    On the revision of planning tasks (2014)

    Herzig, Andreas; Menezes, M. V; Barros, Leliane Nunes de ; Wassermann, Renata

    Source: Proceedings. Conference titles: European Conference on Artificial Intelligence - ECAI. Unidade: IME

    Subjects: INTELIGÊNCIA ARTIFICIAL, LÓGICA MATEMÁTICA

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

    • ABNT

      HERZIG, Andreas et al. On the revision of planning tasks. 2014, Anais.. Amsterdam: IOS Press, 2014. Disponível em: https://doi.org/10.3233/978-1-61499-419-0-435. Acesso em: 15 set. 2024.

    • APA

      Herzig, A., Menezes, M. V., Barros, L. N. de, & Wassermann, R. (2014). On the revision of planning tasks. In Proceedings. Amsterdam: IOS Press. doi:10.3233/978-1-61499-419-0-435

    • NLM

      Herzig A, Menezes MV, Barros LN de, Wassermann R. On the revision of planning tasks [Internet]. Proceedings. 2014 ;[citado 2024 set. 15 ] Available from: https://doi.org/10.3233/978-1-61499-419-0-435

    • Vancouver

      Herzig A, Menezes MV, Barros LN de, Wassermann R. On the revision of planning tasks [Internet]. Proceedings. 2014 ;[citado 2024 set. 15 ] Available from: https://doi.org/10.3233/978-1-61499-419-0-435

  • Trabalho de evento-anais periodico

    The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (2010)

    Acuña, V.; Ferreira, Carlos Eduardo ; Freire, A. S.; Moreno, Eduardo

    Source: Electronic Notes in Discrete Mathematics. Conference titles: International Symposium on Combinatorial Optimization - ISCO. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

    • ABNT

      ACUÑA, V. et al. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2010.05.021. Acesso em: 15 set. 2024. , 2010

    • APA

      Acuña, V., Ferreira, C. E., Freire, A. S., & Moreno, E. (2010). The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2010.05.021

    • NLM

      Acuña V, Ferreira CE, Freire AS, Moreno E. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 159-166.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.endm.2010.05.021

    • Vancouver

      Acuña V, Ferreira CE, Freire AS, Moreno E. The biclique k-clustering problem in bipartite graphs and its application in bioinformatics [Internet]. Electronic Notes in Discrete Mathematics. 2010 ; 36 159-166.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.endm.2010.05.021

  • Trabalho de evento-anais periodico

    Repetition-free longest common subsequence (2010)

    Adi, Said Sadique ; Braga, Marilia D. V. ; Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Martinez, Fábio Henrique Viduani ; Sagot, Marie-France ; Stefanes, Marco Aurélio ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko

    Source: Discrete Applied Mathematics. Conference titles: Latin American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      ADI, Said Sadique et al. Repetition-free longest common subsequence. 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.2009.04.023. Acesso em: 15 set. 2024. , 2010

    • APA

      Adi, S. S., Braga, M. D. V., Fernandes, C. G., Ferreira, C. E., Martinez, F. H. V., Sagot, M. -F., et al. (2010). Repetition-free longest common subsequence. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2009.04.023

    • NLM

      Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12): 1315-1324.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.dam.2009.04.023

    • Vancouver

      Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot M-F, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Discrete Applied Mathematics. 2010 ; 158( 12): 1315-1324.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.dam.2009.04.023

  • Artigo de periodico

    Lossless filter for multiple repetitions with Hamming distance (2008)

    Peterlongo, Pierre; Pisanti, Nadia; Boyer, Frédéric ; Lago, Alair Pereira do; Sagot, Marie-France

    Source: Journal of Discrete Algorithms. Unidade: IME

    Subjects: BANCO DE DADOS, ALGORITMOS

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

    • ABNT

      PETERLONGO, Pierre et al. Lossless filter for multiple repetitions with Hamming distance. Journal of Discrete Algorithms, v. 6, n. 3, p. 497-509, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.jda.2007.03.003. Acesso em: 15 set. 2024.

    • APA

      Peterlongo, P., Pisanti, N., Boyer, F., Lago, A. P. do, & Sagot, M. -F. (2008). Lossless filter for multiple repetitions with Hamming distance. Journal of Discrete Algorithms, 6( 3), 497-509. doi:10.1016/j.jda.2007.03.003

    • NLM

      Peterlongo P, Pisanti N, Boyer F, Lago AP do, Sagot M-F. Lossless filter for multiple repetitions with Hamming distance [Internet]. Journal of Discrete Algorithms. 2008 ; 6( 3): 497-509.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.jda.2007.03.003

    • Vancouver

      Peterlongo P, Pisanti N, Boyer F, Lago AP do, Sagot M-F. Lossless filter for multiple repetitions with Hamming distance [Internet]. Journal of Discrete Algorithms. 2008 ; 6( 3): 497-509.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.jda.2007.03.003

  • Trabalho de evento-anais periodico

    Repetition-free longest common subsequence (2008)

    Adi, Said Sadique ; Braga, Marilia D. V. ; Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Martinez, Fábio Henrique Viduani ; Sagot, Marie France ; Stefanes, Marco Aurélio ; Tjandraatmadja, Christian ; Wakabayashi, Yoshiko

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME

    Assunto: ALGORITMOS DE APROXIMAÇÃO

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

    • ABNT

      ADI, Said Sadique et al. Repetition-free longest common subsequence. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2008.01.042. Acesso em: 15 set. 2024. , 2008

    • APA

      Adi, S. S., Braga, M. D. V., Fernandes, C. G., Ferreira, C. E., Martinez, F. H. V., Sagot, M. F., et al. (2008). Repetition-free longest common subsequence. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2008.01.042

    • NLM

      Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot MF, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Electronic Notes in Discrete Mathematics. 2008 ; 30 243-248.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.endm.2008.01.042

    • Vancouver

      Adi SS, Braga MDV, Fernandes CG, Ferreira CE, Martinez FHV, Sagot MF, Stefanes MA, Tjandraatmadja C, Wakabayashi Y. Repetition-free longest common subsequence [Internet]. Electronic Notes in Discrete Mathematics. 2008 ; 30 243-248.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.endm.2008.01.042

  • Artigo de periodico

    The maximum agreement forest problem: approximation algorithms and computational experiments (2007)

    Rodrigues, Estela Maris; Sagot, Marie-France; Wakabayashi, Yoshiko

    Source: Theoretical Computer Science. Unidade: IME

    Assunto: ALGORITMOS E ESTRUTURAS DE DADOS

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

    • ABNT

      RODRIGUES, Estela Maris e SAGOT, Marie-France e WAKABAYASHI, Yoshiko. The maximum agreement forest problem: approximation algorithms and computational experiments. Theoretical Computer Science, v. 374, n. 1-3, p. 91-110, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2006.12.011. Acesso em: 15 set. 2024.

    • APA

      Rodrigues, E. M., Sagot, M. -F., & Wakabayashi, Y. (2007). The maximum agreement forest problem: approximation algorithms and computational experiments. Theoretical Computer Science, 374( 1-3), 91-110. doi:10.1016/j.tcs.2006.12.011

    • NLM

      Rodrigues EM, Sagot M-F, Wakabayashi Y. The maximum agreement forest problem: approximation algorithms and computational experiments [Internet]. Theoretical Computer Science. 2007 ; 374( 1-3): 91-110.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.tcs.2006.12.011

    • Vancouver

      Rodrigues EM, Sagot M-F, Wakabayashi Y. The maximum agreement forest problem: approximation algorithms and computational experiments [Internet]. Theoretical Computer Science. 2007 ; 374( 1-3): 91-110.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.tcs.2006.12.011

  • Trabalho de evento

    Mathematical modeling of the relationship “between” based on morphological operators (2005)

    Bloch, Isabelle ; Colliot, Olivier ; César Júnior, Roberto Marcondes

    Source: Mathematical morphology: 40 years on : Proceedings. Conference titles: International Symposium on Mathematical Morphology. Unidade: IME

    Subjects: VISÃO COMPUTACIONAL, PROCESSAMENTO DE IMAGENS

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

    • ABNT

      BLOCH, Isabelle e COLLIOT, Olivier e CÉSAR JÚNIOR, Roberto Marcondes. Mathematical modeling of the relationship “between” based on morphological operators. 2005, Anais.. Dordrecht: Springer, 2005. Disponível em: https://doi.org/10.1007/1-4020-3443-1_27. Acesso em: 15 set. 2024.

    • APA

      Bloch, I., Colliot, O., & César Júnior, R. M. (2005). Mathematical modeling of the relationship “between” based on morphological operators. In Mathematical morphology: 40 years on : Proceedings. Dordrecht: Springer. doi:10.1007/1-4020-3443-1_27

    • NLM

      Bloch I, Colliot O, César Júnior RM. Mathematical modeling of the relationship “between” based on morphological operators [Internet]. Mathematical morphology: 40 years on : Proceedings. 2005 ;[citado 2024 set. 15 ] Available from: https://doi.org/10.1007/1-4020-3443-1_27

    • Vancouver

      Bloch I, Colliot O, César Júnior RM. Mathematical modeling of the relationship “between” based on morphological operators [Internet]. Mathematical morphology: 40 years on : Proceedings. 2005 ;[citado 2024 set. 15 ] Available from: https://doi.org/10.1007/1-4020-3443-1_27

  • Artigo de periodico

    Approximate reflectional symmetries of fuzzy objects with an application in model-based object recognition (2004)

    Colliot, Olivier; Tuzikov, Alexander V.; César Júnior, Roberto Marcondes ; Bloch, Isabelle

    Source: Fuzzy Sets and Systems. Unidade: IME

    Assunto: RECONHECIMENTO DE PADRÕES

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

    • ABNT

      COLLIOT, Olivier et al. Approximate reflectional symmetries of fuzzy objects with an application in model-based object recognition. Fuzzy Sets and Systems, v. 147, n. 1, p. 141-163, 2004Tradução . . Disponível em: https://doi.org/10.1016/j.fss.2003.07.003. Acesso em: 15 set. 2024.

    • APA

      Colliot, O., Tuzikov, A. V., César Júnior, R. M., & Bloch, I. (2004). Approximate reflectional symmetries of fuzzy objects with an application in model-based object recognition. Fuzzy Sets and Systems, 147( 1), 141-163. doi:10.1016/j.fss.2003.07.003

    • NLM

      Colliot O, Tuzikov AV, César Júnior RM, Bloch I. Approximate reflectional symmetries of fuzzy objects with an application in model-based object recognition [Internet]. Fuzzy Sets and Systems. 2004 ; 147( 1): 141-163.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.fss.2003.07.003

    • Vancouver

      Colliot O, Tuzikov AV, César Júnior RM, Bloch I. Approximate reflectional symmetries of fuzzy objects with an application in model-based object recognition [Internet]. Fuzzy Sets and Systems. 2004 ; 147( 1): 141-163.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/j.fss.2003.07.003

  • Artigo de periodico

    1-optimality of static BSP computations: scheduling independent chains as a case study (2003)

    Goldman, Alfredo ; Mounie, Gregory; Trystram, Denis

    Source: Theoretical Computer Scence. Unidade: IME

    Assunto: ARQUITETURA E ORGANIZAÇÃO DE COMPUTADORES

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

    • ABNT

      GOLDMAN, Alfredo e MOUNIE, Gregory e TRYSTRAM, Denis. 1-optimality of static BSP computations: scheduling independent chains as a case study. Theoretical Computer Scence, v. 290, n. 3, p. 1331-1359, 2003Tradução . . Disponível em: https://doi.org/10.1016/S0304-3975(02)00039-7. Acesso em: 15 set. 2024.

    • APA

      Goldman, A., Mounie, G., & Trystram, D. (2003). 1-optimality of static BSP computations: scheduling independent chains as a case study. Theoretical Computer Scence, 290( 3), 1331-1359. doi:10.1016/S0304-3975(02)00039-7

    • NLM

      Goldman A, Mounie G, Trystram D. 1-optimality of static BSP computations: scheduling independent chains as a case study [Internet]. Theoretical Computer Scence. 2003 ; 290( 3): 1331-1359.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/S0304-3975(02)00039-7

    • Vancouver

      Goldman A, Mounie G, Trystram D. 1-optimality of static BSP computations: scheduling independent chains as a case study [Internet]. Theoretical Computer Scence. 2003 ; 290( 3): 1331-1359.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/S0304-3975(02)00039-7

  • Trabalho de evento-anais periodico

    Scheduling with duplication on m processors with small communication delays (2001)

    Goldman, Alfredo ; Rapine, Christophe

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics. Unidade: IME

    Assunto: SCHEDULING

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

    • ABNT

      GOLDMAN, Alfredo e RAPINE, Christophe. Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/S1571-0653(04)00255-0. Acesso em: 15 set. 2024. , 2001

    • APA

      Goldman, A., & Rapine, C. (2001). Scheduling with duplication on m processors with small communication delays. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/S1571-0653(04)00255-0

    • NLM

      Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0

    • Vancouver

      Goldman A, Rapine C. Scheduling with duplication on m processors with small communication delays [Internet]. Electronic Notes in Discrete Mathematics. 2001 ; 7 182-185.[citado 2024 set. 15 ] Available from: https://doi.org/10.1016/S1571-0653(04)00255-0
  • 1

1 - 13 (13 records)

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