High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI) (2002)
- Authors:
- USP affiliated authors: HIRATA, NINA SUMIKO TOMITA - IME ; BARRERA, JUNIOR - IME
- Unidade: IME
- DOI: 10.1117/12.468015
- Subjects: CIÊNCIA DA COMPUTAÇÃO; APRENDIZADO COMPUTACIONAL; MATEMÁTICA DA COMPUTAÇÃO
- Keywords: high performance computing; parallel applications; performance analysis; Boolean function minimization
- Language: Inglês
- Imprenta:
- Publisher: SPIE
- Publisher place: Bellingham
- Date published: 2002
- Source:
- Título do periódico: Proceedings of SPIE
- ISSN: 0277-786X
- Volume/Número/Paginação/Ano: v. 4667, p. 386-395, 2002
- Conference titles: Image processing: algorithms and system
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
TORRES, Martha e HIRATA, Nina Sumiko Tomita e BARRERA, Júnior. High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI). Proceedings of SPIE. Bellingham: SPIE. Disponível em: https://doi.org/10.1117/12.468015. Acesso em: 23 abr. 2024. , 2002 -
APA
Torres, M., Hirata, N. S. T., & Barrera, J. (2002). High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI). Proceedings of SPIE. Bellingham: SPIE. doi:10.1117/12.468015 -
NLM
Torres M, Hirata NST, Barrera J. High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI) [Internet]. Proceedings of SPIE. 2002 ; 4667 386-395.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1117/12.468015 -
Vancouver
Torres M, Hirata NST, Barrera J. High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI) [Internet]. Proceedings of SPIE. 2002 ; 4667 386-395.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1117/12.468015 - Iterative design of morphological binary image operators
- Automatic programming of binary morphological machines by design of statistically optimal operators in the context of computational learning theory
- A unifying view for stack filter design based on graph search methods
- Bayesian switching algorithm for the optimal increasing binary filter
- Identification of input-free finite lattice dynamical systems under envelope constraints
- Basis computation algorithms
- Automatic programming of morphological machines by PAC learning
- Multi-resolution classification trees in OCR design
- Modeling temporal morphological systems via lattice dynamical systems
- The incremental splitting of intervals algorithm for the design of binary image operators
Informações sobre o DOI: 10.1117/12.468015 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
