Minimal component-hypertrees (2019)
- Authors:
- Autor USP: HASHIMOTO, RONALDO FUMIO - IME
- Unidade: IME
- DOI: 10.1007/978-3-030-14085-4_22
- Assunto: PROCESSAMENTO DE IMAGENS
- Keywords: mathematical morphology; component-hypertree; component tree; connected component; connected operators
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Conference on Discrete Geometry for Computer Imagery - DGCI
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
MORIMITSU, Alexandre et al. Minimal component-hypertrees. 2019, Anais.. Cham: Springer, 2019. Disponível em: https://doi.org/10.1007/978-3-030-14085-4_22. Acesso em: 13 fev. 2026. -
APA
Morimitsu, A., Alves, W. A. L., Silva, D. J. da, Gobber, C. F., & Hashimoto, R. F. (2019). Minimal component-hypertrees. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-14085-4_22 -
NLM
Morimitsu A, Alves WAL, Silva DJ da, Gobber CF, Hashimoto RF. Minimal component-hypertrees [Internet]. Proceedings. 2019 ;[citado 2026 fev. 13 ] Available from: https://doi.org/10.1007/978-3-030-14085-4_22 -
Vancouver
Morimitsu A, Alves WAL, Silva DJ da, Gobber CF, Hashimoto RF. Minimal component-hypertrees [Internet]. Proceedings. 2019 ;[citado 2026 fev. 13 ] Available from: https://doi.org/10.1007/978-3-030-14085-4_22 - Pattern recognition based on straight line segments
- Growing seed genes from time series data and thresholded Boolean networks with perturbation
- Segmentation of retinal blood vessels based on ultimate elongation opening
- A Monte Carlo approach to measure the robustness of Boolean networks
- A new training algorithm for pattern recognition technique based on straight line segments
- An approach to growth delimitation of straight line segment classifiers based on a minimum bounding box
- Is cross-validation better than resubstitution for ranking genes?
- Inference of restricted stochastic Boolean GRN' s by Bayesian error and entropy based criteria
- Growing genetic regulatory networks from seed genes
- Circuitos e caminhos pares/impares em grafos e digrafos - algoritmo e complexidade computacional
Informações sobre o DOI: 10.1007/978-3-030-14085-4_22 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2934483.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
