Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Mária Ždímalová"'
Autor:
Mária Ždímalová, Anuprava Chatterjee, Helena Kosnáčová, Mridul Ghosh, Sk Md Obaidullah, Martin Kopáni, Daniel Kosnáč
Publikováno v:
Symmetry, Vol 14, Iss 1, p 7 (2021)
Biomedical data (structured and unstructured) has grown dramatically in strength and volume over the last few years. Innovative, intelligent, and autonomous scientific approaches are needed to examine the large data sets that are gradually becoming w
Externí odkaz:
https://doaj.org/article/bfbe0354297b4f2da501478473402c99
Autor:
Mária Ždímalová, Kristína Boratková
Publikováno v:
Third Congress on Intelligent Systems ISBN: 9789811992247
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::626a0c704ae5e61840017dde2f3b1005
https://doi.org/10.1007/978-981-19-9225-4_9
https://doi.org/10.1007/978-981-19-9225-4_9
Publikováno v:
Tatra Mountains Mathematical Publications. 75:163-190
In this paper, we present a graph theoretical approach to image processing with focus on the analysis of the biological data. We use the graph cut algorithms and extend them to obtain a segmentation of the biological cells. We introduce an utterly ne
Publikováno v:
Mechanisms and Machine Science ISBN: 9783030767860
We consider graph theoretical approach to image processing, especially to segmentation of the biological images. At first, we provide a brief overview of methods from graph theory used for to image segmentation. Next, we focus on graph cuts method an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da6fb8ba9f305030456e0c4dcd97cc1e
https://doi.org/10.1007/978-3-030-76787-7_7
https://doi.org/10.1007/978-3-030-76787-7_7
Publikováno v:
Open Physics, Vol 17, Iss 1, Pp 468-479 (2019)
In this paper we introduce the concept of segmentation based on mathematical approach using graph theory algorithms using the family of augmenting paths algorithms. We present a new program, an implementation, algorithms and obtained results devoted
Publikováno v:
Discrete Applied Mathematics. 263:204-211
Graphs and digraphs with maximum order allowed by its degree and diameter have been widely studied in the context of the Degree/Diameter problem. This problem turns out to be very interesting in the mixed case, where many open problems arise, special
Autor:
Aleksandar Čučaković, Mirjana Komnenov, Dragica Obratov-Petkovic, Biljana Jović, Mária Ždímalová
Publikováno v:
Faces of Geometry ISBN: 9783030637019
This paper deals with the flower geometry analysis of the species Campanula patula L. (Campanulaceae) and attempts to use a freeform curve to transpose it into a surface model that can serve as a geometric pattern. Interest in geometric forms and pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::081cb152e7192cd385f2a15e271f17b0
https://doi.org/10.1007/978-3-030-63702-6_11
https://doi.org/10.1007/978-3-030-63702-6_11
Publikováno v:
Indian Statistical Institute Series ISBN: 9789811647369
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c79fd739017c6566fdd91f2bfcac02ec
https://doi.org/10.1007/978-981-16-4737-6_12
https://doi.org/10.1007/978-981-16-4737-6_12
Convergence of Linear Approximation of Archimedean Generator from Williamson’s Transform in Examples
Autor:
Mária Ždímalová, Tomáš Bacigál
Publikováno v:
Tatra Mountains Mathematical Publications. 69:1-18
We discuss a new construction method for obtaining additive generators of Archimedean copulas proposed by McNeil, A. J.-Nešlehová, J.: Multivariate Archimedean copulas, d-monotone functions and l1-norm symmetric distributions, Ann. Statist. 37 (200
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree. A mixed regular graphs is said to be optimal if there is not a mixed regular graph with the same para