ReP USP - Resultado da busca

Trabalho de evento
Antialiasing of curves by discrete pre-filtering (1997)
Fabris, Antonio Elias ; Forrest, A. Robin
Source: Proceedings. Conference titles: International Conference on Computer Graphics and Interactive Techniques - SIGGRAPH. Unidade: IME
Assunto: COMPUTAÇÃO GRÁFICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FABRIS, Antonio Elias e FORREST, A. Robin. Antialiasing of curves by discrete pre-filtering. 1997, Anais.. New Uork: ACM, 1997. Disponível em: https://doi.org/10.1145/258734.258874. Acesso em: 16 nov. 2024.
APA
Fabris, A. E., & Forrest, A. R. (1997). Antialiasing of curves by discrete pre-filtering. In Proceedings. New Uork: ACM. doi:10.1145/258734.258874
NLM
Fabris AE, Forrest AR. Antialiasing of curves by discrete pre-filtering [Internet]. Proceedings. 1997 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/258734.258874
Vancouver
Fabris AE, Forrest AR. Antialiasing of curves by discrete pre-filtering [Internet]. Proceedings. 1997 ;[citado 2024 nov. 16 ] Available from: https://doi.org/10.1145/258734.258874
Trabalho de evento
A better approximation ratio for the minimum k-edge-connected spanning subgraph problem (1997)
Fernandes, Cristina Gomes
Source: Proceedings. Conference titles: ACM-SIAM symposium on Discrete algorithms - SODA. Unidade: IME
Subjects: ALGORITMOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. 1997, Anais.. New York: ACM, 1997. Disponível em: https://dl.acm.org/citation.cfm?id=314161.314402. Acesso em: 16 nov. 2024.
APA
Fernandes, C. G. (1997). A better approximation ratio for the minimum k-edge-connected spanning subgraph problem. In Proceedings. New York: ACM. Recuperado de https://dl.acm.org/citation.cfm?id=314161.314402
NLM
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Proceedings. 1997 ;[citado 2024 nov. 16 ] Available from: https://dl.acm.org/citation.cfm?id=314161.314402
Vancouver
Fernandes CG. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem [Internet]. Proceedings. 1997 ;[citado 2024 nov. 16 ] Available from: https://dl.acm.org/citation.cfm?id=314161.314402
Trabalho de evento
A navigation-oriented hypertext model based on statecharts (1997)
Turine, Marcelo Augusto Santos; Oliveira, Maria Cristina Ferreira de ; Masiero, Paulo Cesar
Conference titles: ÀCM Conference on HYPERTEXT. Unidade: ICMC
Assunto: ENGENHARIA DE SOFTWARE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TURINE, Marcelo Augusto Santos e OLIVEIRA, Maria Cristina Ferreira de e MASIERO, Paulo Cesar. A navigation-oriented hypertext model based on statecharts. 1997, Anais.. Southampton: ACM, 1997. . Acesso em: 16 nov. 2024.
APA
Turine, M. A. S., Oliveira, M. C. F. de, & Masiero, P. C. (1997). A navigation-oriented hypertext model based on statecharts. In . Southampton: ACM.
NLM
Turine MAS, Oliveira MCF de, Masiero PC. A navigation-oriented hypertext model based on statecharts. 1997 ;[citado 2024 nov. 16 ]
Vancouver
Turine MAS, Oliveira MCF de, Masiero PC. A navigation-oriented hypertext model based on statecharts. 1997 ;[citado 2024 nov. 16 ]

USP Schools

ReP

Filtros

Authors