ReP USP - Resultado da busca

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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] 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: 17 nov. 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 nov. 17 ] 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 nov. 17 ] Available from: https://doi.org/10.1007/3-540-69346-7_11
Trabalho de evento
Representation of gray-scale windowed operators (1998)
Barrera, Júnior; Dougherty, Edward R
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
BARRERA, Júnior e DOUGHERTY, Edward R. Representation of gray-scale windowed operators. 1998, Anais.. New York: ACM, 1998. Disponível em: https://dl.acm.org/doi/10.5555/295095.295103. Acesso em: 17 nov. 2024.
APA
Barrera, J., & Dougherty, E. R. (1998). Representation of gray-scale windowed operators. In Proceedings. New York: ACM. doi:10.5555/295095.295103
NLM
Barrera J, Dougherty ER. Representation of gray-scale windowed operators [Internet]. Proceedings. 1998 ;[citado 2024 nov. 17 ] Available from: https://dl.acm.org/doi/10.5555/295095.295103
Vancouver
Barrera J, Dougherty ER. Representation of gray-scale windowed operators [Internet]. Proceedings. 1998 ;[citado 2024 nov. 17 ] Available from: https://dl.acm.org/doi/10.5555/295095.295103

USP Schools

ReP

Filtros