Zobrazeno 1 - 10
of 10
pro vyhledávání: '"MIROŠEVIĆ, IVANČICA"'
Autor:
Koceić-Bilan, Nikola1 (AUTHOR) koceic@pmfst.hr, Mirošević, Ivančica2 (AUTHOR) ivancica.mirosevic@fesb.hr
Publikováno v:
Mathematics (2227-7390). Oct2023, Vol. 11 Issue 20, p4294. 8p.
Publikováno v:
In Topology and its Applications 15 August 2019 263:74-89
Autor:
BILAN, NIKOLA KOCEIĆ1 koceic@pmfst.hr, MIROŠEVIĆ, IVANČICA2 ivancica.mirosevic@fesb.hr
Publikováno v:
Homology, Homotopy & Applications. 2020, Vol. 22 Issue 1, p55-68. 14p.
A new generalized definition of homotopy is proposed, including a new class of continuous mappings that we call box-homotopies. It turns out that to be box-homotopic is an equivalence relation on Top(X, Y) and HTop(X, Y), and that it is well adjusted
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=57a035e5b1ae::9de992df8d7585e8c5a39ed8164d06c3
https://www.bib.irb.hr/1028708
https://www.bib.irb.hr/1028708
Autor:
Mirošević, Ivančica
U ovom radu dajemo novu karakterizaciju grupa gruboga oblika punktiranih topoloških prostora, temeljnih invarijanti teorije gruboga oblika. Uvodimo novi funktor \(\widetilde R\) iz \(pro^{*}\text{-}Grp\) u \( pro\text{-}Grp\) kategoriju. Pokaže se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::32f3b81167bcc9237eaba04f9ae74d91
https://www.bib.irb.hr/1061039
https://www.bib.irb.hr/1061039
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mirošević, Ivančica
Problem klasteriranja formuliran je kao diskretni optimizacijski problem biparticioniranja grafa, čija relaksirana verzija upu- ćuje na svojstvene vektore Laplaceove matrice grafa. Definirane su dvije varijante ciljne funkcije, razmjerni i normaliz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=57a035e5b1ae::985d67af9c5ed66bf2b8154f8a51b584
https://www.bib.irb.hr/892447
https://www.bib.irb.hr/892447
Autor:
Mirošević, Ivančica
U članku je objašnjen algoritam k-sredina (k- means algorithm), heuristika koja rješava NP teški optimizacijski problem razvrstavanja podataka (točaka) u skupine (klastere) s unaprijed zadanim brojem skupina. Zbog jednostavnosti i brzine konverg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=57a035e5b1ae::8590b903050b4ac372b3996fc094c0e9
https://www.bib.irb.hr/866273
https://www.bib.irb.hr/866273
The main idea of spectral clustering is in modeling of a data set in a form of a simple undirected weighted graph, and observing the graph Laplacian spectrum. Usually, data partition can be reconstructed from dominant eigenvectors. We introduce sever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=57a035e5b1ae::9633b03c4533a9a3ca7ebcf5608f622a
https://www.bib.irb.hr/585396
https://www.bib.irb.hr/585396
Autor:
Mirošević, Ivančica
Važna primjena particioniranja grafa je razvrstavanje podataka u skupine uporabom modela grafa. Sličnosti među parovima podataka definiraju matricu susjedstva težinskog grafa koja sadrži sve informacije potrebne za razvrstavanje podataka. U ovom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=57a035e5b1ae::e83e5101097378481d30ccb586a66c7a
https://www.bib.irb.hr/201479
https://www.bib.irb.hr/201479