ReP USP - Resultado da busca

Artigo de periodico
How do annotations affect Java code readability? (2024)
Guerra, Eduardo Martins ; Gomes, Everaldo; Ferreira, Jeferson; Wiese, Igor ; Lima, Phyllipe ; Gerosa, Marco Aurélio ; Meirelles, Paulo
Source: Empirical Software Engineering. Unidade: IME
Subjects: ENGENHARIA DE SOFTWARE, DESENVOLVIMENTO DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUERRA, Eduardo Martins et al. How do annotations affect Java code readability?. Empirical Software Engineering, v. 29, n. artigo 62, p. 1-31, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10664-024-10460-w. Acesso em: 05 ago. 2024.
APA
Guerra, E. M., Gomes, E., Ferreira, J., Wiese, I., Lima, P., Gerosa, M. A., & Meirelles, P. (2024). How do annotations affect Java code readability? Empirical Software Engineering, 29( artigo 62), 1-31. doi:10.1007/s10664-024-10460-w
NLM
Guerra EM, Gomes E, Ferreira J, Wiese I, Lima P, Gerosa MA, Meirelles P. How do annotations affect Java code readability? [Internet]. Empirical Software Engineering. 2024 ; 29( artigo 62): 1-31.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/s10664-024-10460-w
Vancouver
Guerra EM, Gomes E, Ferreira J, Wiese I, Lima P, Gerosa MA, Meirelles P. How do annotations affect Java code readability? [Internet]. Empirical Software Engineering. 2024 ; 29( artigo 62): 1-31.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/s10664-024-10460-w
Artigo de periodico
Mapping the walk: a scalable computer vision approach for generating sidewalk network datasets from aerial imagery (2023)
Hosseini, Maryam; Sevtsuk, Andres ; Miranda, Fabio ; César Júnior, Roberto Marcondes ; Silva, Claudio T.
Source: Computers, Environment and Urban Systems. Unidade: IME
Subjects: MOBILIDADE URBANA, COMPUTAÇÃO APLICADA, SEMÂNTICA DE PROGRAMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOSSEINI, Maryam et al. Mapping the walk: a scalable computer vision approach for generating sidewalk network datasets from aerial imagery. Computers, Environment and Urban Systems, v. 101, n. artigo 101950, p. 1-13, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.compenvurbsys.2023.101950. Acesso em: 05 ago. 2024.
APA
Hosseini, M., Sevtsuk, A., Miranda, F., César Júnior, R. M., & Silva, C. T. (2023). Mapping the walk: a scalable computer vision approach for generating sidewalk network datasets from aerial imagery. Computers, Environment and Urban Systems, 101( artigo 101950), 1-13. doi:10.1016/j.compenvurbsys.2023.101950
NLM
Hosseini M, Sevtsuk A, Miranda F, César Júnior RM, Silva CT. Mapping the walk: a scalable computer vision approach for generating sidewalk network datasets from aerial imagery [Internet]. Computers, Environment and Urban Systems. 2023 ; 101( artigo 101950): 1-13.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.compenvurbsys.2023.101950
Vancouver
Hosseini M, Sevtsuk A, Miranda F, César Júnior RM, Silva CT. Mapping the walk: a scalable computer vision approach for generating sidewalk network datasets from aerial imagery [Internet]. Computers, Environment and Urban Systems. 2023 ; 101( artigo 101950): 1-13.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.compenvurbsys.2023.101950
Artigo de periodico
AMEBaS: automatic midline extraction and background subtraction of ratiometric fluorescence time-lapses of polarized single cells (2023)
Badain, Rafael ; Damineli, Daniel S. C. ; Portes, Maria Teresa ; Feijó, José ; Buratti, Stefano ; Tortora, Giorgia ; Oliveira, Hugo Neves de ; César Júnior, Roberto Marcondes
Source: Journal of Visualized Experiments. Unidades: IB, IME, PRÓ-G, FM
Assunto: PROCESSAMENTO DE IMAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BADAIN, Rafael et al. AMEBaS: automatic midline extraction and background subtraction of ratiometric fluorescence time-lapses of polarized single cells. Journal of Visualized Experiments, v. 196, n. artigo e64857, p. 1-15, 2023Tradução . . Disponível em: https://doi.org/10.3791/64857. Acesso em: 05 ago. 2024.
APA
Badain, R., Damineli, D. S. C., Portes, M. T., Feijó, J., Buratti, S., Tortora, G., et al. (2023). AMEBaS: automatic midline extraction and background subtraction of ratiometric fluorescence time-lapses of polarized single cells. Journal of Visualized Experiments, 196( artigo e64857), 1-15. doi:10.3791/64857
NLM
Badain R, Damineli DSC, Portes MT, Feijó J, Buratti S, Tortora G, Oliveira HN de, César Júnior RM. AMEBaS: automatic midline extraction and background subtraction of ratiometric fluorescence time-lapses of polarized single cells [Internet]. Journal of Visualized Experiments. 2023 ; 196( artigo e64857): 1-15.[citado 2024 ago. 05 ] Available from: https://doi.org/10.3791/64857
Vancouver
Badain R, Damineli DSC, Portes MT, Feijó J, Buratti S, Tortora G, Oliveira HN de, César Júnior RM. AMEBaS: automatic midline extraction and background subtraction of ratiometric fluorescence time-lapses of polarized single cells [Internet]. Journal of Visualized Experiments. 2023 ; 196( artigo e64857): 1-15.[citado 2024 ago. 05 ] Available from: https://doi.org/10.3791/64857
Artigo de periodico
A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures (2022)
Geng, Tongsheng ; Amarís, Marcos ; Zuckerman, Stéphane ; Goldman, Alfredo ; Gao, Guang R.; Gaudiot, Jean-Luc
Source: International Journal of Parallel Programming. Unidade: IME
Subjects: APRENDIZADO COMPUTACIONAL, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GENG, Tongsheng et al. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures. International Journal of Parallel Programming, v. 50, n. 1, p. 115-151, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10766-021-00721-2. Acesso em: 05 ago. 2024.
APA
Geng, T., Amarís, M., Zuckerman, S., Goldman, A., Gao, G. R., & Gaudiot, J. -L. (2022). A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures. International Journal of Parallel Programming, 50( 1), 115-151. doi:10.1007/s10766-021-00721-2
NLM
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures [Internet]. International Journal of Parallel Programming. 2022 ; 50( 1): 115-151.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/s10766-021-00721-2
Vancouver
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures [Internet]. International Journal of Parallel Programming. 2022 ; 50( 1): 115-151.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/s10766-021-00721-2
Trabalho de evento
Constructive interpretability with colabel: corroborative integration, complementary features, and collaborative learning (2022)
Suprem, Abhijit; Vaidya, Sanjyot; Cherkadi, Suma; Singh, Purva; Ferreira, João Eduardo ; Pu, Calton
Source: Proceedings. Conference titles: International Conference on Cognitive Machine Intelligence - CogMI. Unidade: IME
Subjects: VISÃO COMPUTACIONAL, ENGENHARIA DE CONHECIMENTO, RECONHECIMENTO DE OBJETOS, VEÍCULOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SUPREM, Abhijit et al. Constructive interpretability with colabel: corroborative integration, complementary features, and collaborative learning. 2022, Anais.. Piscataway: IEEE, 2022. Disponível em: https://doi.org/10.1109/CogMI56440.2022.00021. Acesso em: 05 ago. 2024.
APA
Suprem, A., Vaidya, S., Cherkadi, S., Singh, P., Ferreira, J. E., & Pu, C. (2022). Constructive interpretability with colabel: corroborative integration, complementary features, and collaborative learning. In Proceedings. Piscataway: IEEE. doi:10.1109/CogMI56440.2022.00021
NLM
Suprem A, Vaidya S, Cherkadi S, Singh P, Ferreira JE, Pu C. Constructive interpretability with colabel: corroborative integration, complementary features, and collaborative learning [Internet]. Proceedings. 2022 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1109/CogMI56440.2022.00021
Vancouver
Suprem A, Vaidya S, Cherkadi S, Singh P, Ferreira JE, Pu C. Constructive interpretability with colabel: corroborative integration, complementary features, and collaborative learning [Internet]. Proceedings. 2022 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1109/CogMI56440.2022.00021
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: 05 ago. 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 ago. 05 ] 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 ago. 05 ] Available from: https://doi.org/10.1140/epjb/s10051-021-00202-y
Artigo de periodico
On strong Sidon sets of integers (2021)
Kohayakawa, Yoshiharu ; Lee, Sang June ; Moreira, Carlos Gustavo; Rodl, Vojtech
Source: Journal of Combinatorial Theory, Series A. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. On strong Sidon sets of integers. Journal of Combinatorial Theory, Series A, v. 183, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2021.105490. Acesso em: 05 ago. 2024.
APA
Kohayakawa, Y., Lee, S. J., Moreira, C. G., & Rodl, V. (2021). On strong Sidon sets of integers. Journal of Combinatorial Theory, Series A, 183. doi:10.1016/j.jcta.2021.105490
NLM
Kohayakawa Y, Lee SJ, Moreira CG, Rodl V. On strong Sidon sets of integers [Internet]. Journal of Combinatorial Theory, Series A. 2021 ; 183[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.jcta.2021.105490
Vancouver
Kohayakawa Y, Lee SJ, Moreira CG, Rodl V. On strong Sidon sets of integers [Internet]. Journal of Combinatorial Theory, Series A. 2021 ; 183[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/j.jcta.2021.105490
Trabalho de evento
Averaging gone wrong: using time-aware analyses to better understand behavior (2016)
Barbosa Neto, Samuel Martins; Cosley, Dan; Sharma, Amit; César Júnior, Roberto Marcondes
Source: Proceedings. Conference titles: International World Wide Web Conference - WWW. Unidade: IME
Subjects: COMPUTAÇÃO APLICADA, CIÊNCIAS SOCIAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARBOSA NETO, Samuel Martins et al. Averaging gone wrong: using time-aware analyses to better understand behavior. 2016, Anais.. New York: ACM, 2016. Disponível em: https://doi.org/10.1145/2872427.2883083. Acesso em: 05 ago. 2024.
APA
Barbosa Neto, S. M., Cosley, D., Sharma, A., & César Júnior, R. M. (2016). Averaging gone wrong: using time-aware analyses to better understand behavior. In Proceedings. New York: ACM. doi:10.1145/2872427.2883083
NLM
Barbosa Neto SM, Cosley D, Sharma A, César Júnior RM. Averaging gone wrong: using time-aware analyses to better understand behavior [Internet]. Proceedings. 2016 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1145/2872427.2883083
Vancouver
Barbosa Neto SM, Cosley D, Sharma A, César Júnior RM. Averaging gone wrong: using time-aware analyses to better understand behavior [Internet]. Proceedings. 2016 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1145/2872427.2883083
Trabalho de evento
An improved upper bound on the density of universal random graphs (2012)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-29344-3_20. Acesso em: 05 ago. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2012). An improved upper bound on the density of universal random graphs. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-29344-3_20
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Proceedings. 2012 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/978-3-642-29344-3_20
Artigo de periodico
Maximum series-parallel subgraph (2012)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Kaul, Hemanshu; Zelikovsky, Alexander
Source: Algorithmica. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia et al. Maximum series-parallel subgraph. Algorithmica, v. 63, n. 1-2, p. 137-157, 2012Tradução . . Disponível em: https://doi.org/10.1007/s00453-011-9523-4. Acesso em: 05 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., Kaul, H., & Zelikovsky, A. (2012). Maximum series-parallel subgraph. Algorithmica, 63( 1-2), 137-157. doi:10.1007/s00453-011-9523-4
NLM
Calinescu G, Fernandes CG, Kaul H, Zelikovsky A. Maximum series-parallel subgraph [Internet]. Algorithmica. 2012 ; 63( 1-2): 137-157.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/s00453-011-9523-4
Vancouver
Calinescu G, Fernandes CG, Kaul H, Zelikovsky A. Maximum series-parallel subgraph [Internet]. Algorithmica. 2012 ; 63( 1-2): 137-157.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/s00453-011-9523-4
Trabalho de evento
Maximum series-parallel subgraph (2010)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Kaul, Hemanshu
Source: Proceedings. Conference titles: International Workshop on Graph-Theoretic Concepts in Computer Science - WG. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e KAUL, Hemanshu. Maximum series-parallel subgraph. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-11409-0_5. Acesso em: 05 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., & Kaul, H. (2010). Maximum series-parallel subgraph. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-11409-0_5
NLM
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5
Vancouver
Calinescu G, Fernandes CG, Kaul H. Maximum series-parallel subgraph [Internet]. Proceedings. 2010 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/978-3-642-11409-0_5
Artigo de periodico
Intrinsically multivariate predictive genes (2008)
Martins Júnior, David Correa; Braga-Neto, Ulisses de M.; Hashimoto, Ronaldo Fumio ; Bittner, Michael L.; Dougherty, Edward R.
Source: IEEE Journal of Selected Topics in Signal Processing. Unidade: IME
Subjects: COMPUTAÇÃO GRÁFICA, GENES, BIOINFORMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTINS JÚNIOR, David Correa et al. Intrinsically multivariate predictive genes. IEEE Journal of Selected Topics in Signal Processing, v. 2, n. 3, p. 424-439, 2008Tradução . . Disponível em: https://doi.org/10.1109/JSTSP.2008.923841. Acesso em: 05 ago. 2024.
APA
Martins Júnior, D. C., Braga-Neto, U. de M., Hashimoto, R. F., Bittner, M. L., & Dougherty, E. R. (2008). Intrinsically multivariate predictive genes. IEEE Journal of Selected Topics in Signal Processing, 2( 3), 424-439. doi:10.1109/JSTSP.2008.923841
NLM
Martins Júnior DC, Braga-Neto U de M, Hashimoto RF, Bittner ML, Dougherty ER. Intrinsically multivariate predictive genes [Internet]. IEEE Journal of Selected Topics in Signal Processing. 2008 ; 2( 3): 424-439.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1109/JSTSP.2008.923841
Vancouver
Martins Júnior DC, Braga-Neto U de M, Hashimoto RF, Bittner ML, Dougherty ER. Intrinsically multivariate predictive genes [Internet]. IEEE Journal of Selected Topics in Signal Processing. 2008 ; 2( 3): 424-439.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1109/JSTSP.2008.923841
Artigo de periodico
A sparse dynamic programming algorithm for alignment with non-overlapping inversions (2005)
Lago, Alair Pereira do; Muchnik, I.; Kulikowski, C.
Source: Rairo - Theoretical Informatics and Applications, Paris. Unidade: IME
Assunto: SISTEMAS DE INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LAGO, Alair Pereira do e MUCHNIK, I. e KULIKOWSKI, C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions. Rairo - Theoretical Informatics and Applications, Paris, v. 39, n. 1, p. 175-189, 2005Tradução . . Disponível em: https://doi.org/10.1051/ita:2005011. Acesso em: 05 ago. 2024.
APA
Lago, A. P. do, Muchnik, I., & Kulikowski, C. (2005). A sparse dynamic programming algorithm for alignment with non-overlapping inversions. Rairo - Theoretical Informatics and Applications, Paris, 39( 1), 175-189. doi:10.1051/ita:2005011
NLM
Lago AP do, Muchnik I, Kulikowski C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 175-189.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1051/ita:2005011
Vancouver
Lago AP do, Muchnik I, Kulikowski C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 175-189.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1051/ita:2005011
Artigo de periodico
Design, implementation, and performance of an automatic configuration service for distributed component systems (2005)
Kon, Fábio ; Marques, Jeferson Roberto; Yamane, Tomonori; Campbell, Roy H.; Mickunas, M Dennis
Source: Software - Practice and Experience, Sussex. Unidade: IME
Assunto: MIDDLEWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KON, Fábio et al. Design, implementation, and performance of an automatic configuration service for distributed component systems. Software - Practice and Experience, Sussex, v. 35, n. 7, p. 667-703, 2005Tradução . . Disponível em: https://doi.org/10.1002/spe.654. Acesso em: 05 ago. 2024.
APA
Kon, F., Marques, J. R., Yamane, T., Campbell, R. H., & Mickunas, M. D. (2005). Design, implementation, and performance of an automatic configuration service for distributed component systems. Software - Practice and Experience, Sussex, 35( 7), 667-703. doi:10.1002/spe.654
NLM
Kon F, Marques JR, Yamane T, Campbell RH, Mickunas MD. Design, implementation, and performance of an automatic configuration service for distributed component systems [Internet]. Software - Practice and Experience, Sussex. 2005 ; 35( 7): 667-703.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/spe.654
Vancouver
Kon F, Marques JR, Yamane T, Campbell RH, Mickunas MD. Design, implementation, and performance of an automatic configuration service for distributed component systems [Internet]. Software - Practice and Experience, Sussex. 2005 ; 35( 7): 667-703.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1002/spe.654
Artigo de periodico
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width (2003)
Calinescu, Gruia; Fernandes, Cristina Gomes ; Reed, Bruce A.
Source: Journal of Algorithms. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce A. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, v. 48, n. 2, p. 333-359, 2003Tradução . . Disponível em: https://doi.org/10.1016/s0196-6774(03)00073-7. Acesso em: 05 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. A. (2003). Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. Journal of Algorithms, 48( 2), 333-359. doi:10.1016/s0196-6774(03)00073-7
NLM
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Vancouver
Calinescu G, Fernandes CG, Reed BA. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width [Internet]. Journal of Algorithms. 2003 ; 48( 2): 333-359.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/s0196-6774(03)00073-7
Artigo de periodico
The case for reflective middleware (2002)
Kon, Fábio ; Costa, Fabio; Blair, Gordon; Campbell, Roy H.
Source: Communications of the ACM. Unidade: IME
Assunto: ENGENHARIA DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KON, Fábio et al. The case for reflective middleware. Communications of the ACM, v. 45, n. 6, p. 33-38, 2002Tradução . . Disponível em: https://doi.org/10.1145/508448.508470. Acesso em: 05 ago. 2024.
APA
Kon, F., Costa, F., Blair, G., & Campbell, R. H. (2002). The case for reflective middleware. Communications of the ACM, 45( 6), 33-38. doi:10.1145/508448.508470
NLM
Kon F, Costa F, Blair G, Campbell RH. The case for reflective middleware [Internet]. Communications of the ACM. 2002 ; 45( 6): 33-38.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1145/508448.508470
Vancouver
Kon F, Costa F, Blair G, Campbell RH. The case for reflective middleware [Internet]. Communications of the ACM. 2002 ; 45( 6): 33-38.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1145/508448.508470
Trabalho de evento-resumo
An optimal algorithm for checking regularity: (extended abstract) (2002)
Kohayakawa, Yoshiharu ; Rödl, Vojtěch; Thoma, Luboš
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e RÖDL, Vojtěch e THOMA, Luboš. An optimal algorithm for checking regularity: (extended abstract). 2002, Anais.. Philadelphia: SIAM, 2002. Disponível em: https://dl.acm.org/doi/pdf/10.5555/545381.545418. Acesso em: 05 ago. 2024.
APA
Kohayakawa, Y., Rödl, V., & Thoma, L. (2002). An optimal algorithm for checking regularity: (extended abstract). In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/doi/pdf/10.5555/545381.545418
NLM
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2024 ago. 05 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
Vancouver
Kohayakawa Y, Rödl V, Thoma L. An optimal algorithm for checking regularity: (extended abstract) [Internet]. Proceedings. 2002 ;[citado 2024 ago. 05 ] Available from: https://dl.acm.org/doi/pdf/10.5555/545381.545418
Artigo de periodico
Using dynamic configuration to manage a scalable multimedia distribution system (2001)
Kon, Fábio ; Campbell, Roy H.; Mickunas, Marshall Dennis; Nahrstedt, K.
Source: Computer Communications. Unidade: IME
Assunto: SISTEMAS DISTRIBUÍDOS (SISTEMA OPERACIONAL)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KON, Fábio et al. Using dynamic configuration to manage a scalable multimedia distribution system. Computer Communications, v. 24, p. 105-123, 2001Tradução . . Disponível em: https://doi.org/10.1016/s0140-3664(00)00293-0. Acesso em: 05 ago. 2024.
APA
Kon, F., Campbell, R. H., Mickunas, M. D., & Nahrstedt, K. (2001). Using dynamic configuration to manage a scalable multimedia distribution system. Computer Communications, 24, 105-123. doi:10.1016/s0140-3664(00)00293-0
NLM
Kon F, Campbell RH, Mickunas MD, Nahrstedt K. Using dynamic configuration to manage a scalable multimedia distribution system [Internet]. Computer Communications. 2001 ; 24 105-123.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/s0140-3664(00)00293-0
Vancouver
Kon F, Campbell RH, Mickunas MD, Nahrstedt K. Using dynamic configuration to manage a scalable multimedia distribution system [Internet]. Computer Communications. 2001 ; 24 105-123.[citado 2024 ago. 05 ] Available from: https://doi.org/10.1016/s0140-3664(00)00293-0
Trabalho de evento
Prior information in the design of optimal binary filters (1998)
Dougherty, Edward R; Barrera, Júnior
Source: Proceedings. Conference titles: International symposium on Mathematical morphology and its applications to image and signal processing - ISMM. Unidade: IME
Subjects: PROCESSAMENTO DE IMAGENS, PROCESSAMENTO DE SINAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DOUGHERTY, Edward R e BARRERA, Júnior. Prior information in the design of optimal binary filters. 1998, Anais.. New York: ACM, 1998. Disponível em: https://dl.acm.org/doi/10.5555/295095.295180. Acesso em: 05 ago. 2024.
APA
Dougherty, E. R., & Barrera, J. (1998). Prior information in the design of optimal binary filters. In Proceedings. New York: ACM. doi:10.5555/295095.295180
NLM
Dougherty ER, Barrera J. Prior information in the design of optimal binary filters [Internet]. Proceedings. 1998 ;[citado 2024 ago. 05 ] Available from: https://dl.acm.org/doi/10.5555/295095.295180
Vancouver
Dougherty ER, Barrera J. Prior information in the design of optimal binary filters [Internet]. Proceedings. 1998 ;[citado 2024 ago. 05 ] Available from: https://dl.acm.org/doi/10.5555/295095.295180
Trabalho de evento
Multicuts in unweighted graphs with bounded degree and bounded tree-width (1998)
Calinescu, Gruia ; Fernandes, Cristina Gomes ; Reed, Bruce
Source: Proceedings. Conference titles: Integer Programming and Combinatorial Optimization - IPCO. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CALINESCU, Gruia e FERNANDES, Cristina Gomes e REED, Bruce. Multicuts in unweighted graphs with bounded degree and bounded tree-width. 1998, Anais.. Berlin: Springer, 1998. Disponível em: https://doi.org/10.1007/3-540-69346-7_11. Acesso em: 05 ago. 2024.
APA
Calinescu, G., Fernandes, C. G., & Reed, B. (1998). Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Proceedings. Berlin: Springer. doi:10.1007/3-540-69346-7_11
NLM
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
Vancouver
Calinescu G, Fernandes CG, Reed B. Multicuts in unweighted graphs with bounded degree and bounded tree-width [Internet]. Proceedings. 1998 ;[citado 2024 ago. 05 ] Available from: https://doi.org/10.1007/3-540-69346-7_11

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Funding Agencies

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration