Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Domagoj Matijević"'
Publikováno v:
Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-12 (2024)
Abstract Metric multidimensional scaling is one of the classical methods for embedding data into low-dimensional Euclidean space. It creates the low-dimensional embedding by approximately preserving the pairwise distances between the input points. Ho
Externí odkaz:
https://doaj.org/article/1cd6811517a8445d81e32bd86545987e
Publikováno v:
Journal of Computing and Information Technology, Vol 31, Iss 4, Pp 251-266 (2023)
Addressing the demand for effective sentence representation in natural language inference problems, this paper explores the utility of pre-trained large language models in computing such representations. Although these models generate high-dimensiona
Externí odkaz:
https://doaj.org/article/cd5833f5d995497d91d289945e3f0365
Publikováno v:
Croatian Operational Research Review, Vol 14, Iss 1, Pp 1-13 (2023)
The accurate short-term forecasting of daily airborne pollen concentrations is of great importance in public health. Various machine learning and statistical techniques have been employed to predict these concentrations. In this paper, an RNN-based m
Externí odkaz:
https://doaj.org/article/1c6b124e2d4548a293d81e09f0d45e11
Autor:
Domagoj Matijević
Publikováno v:
Journal of Open Research Software, Vol 12, Iss 1, Pp 1-1 (2024)
Well-separated pair decomposition (WSPD) is a well-known geometric decomposition used for encoding distances, introduced in 1995 by Paul B. Callahan and S. Rao Kosaraju in a seminal paper. We implemented this remarkable decomposition following the no
Externí odkaz:
https://doaj.org/article/d4d9d09e0c2f4d629fd3eb61f6eaabd0
Autor:
Domagoj Matijević
Publikováno v:
Algorithms, Vol 16, Iss 5, p 254 (2023)
Well-separated pair decomposition (WSPD) is a well known geometric decomposition used for encoding distances, introduced in a seminal paper by Paul B. Callahan and S. Rao Kosaraju in 1995. WSPD compresses O(n2) pairwise distances of n given points fr
Externí odkaz:
https://doaj.org/article/31d2e4a73cd642a2bc5d9bb066fb18d0
Publikováno v:
Croatian Operational Research Review, Vol 6, Iss 2, Pp 419-427 (2015)
The paper deals with modelling a specifc problem called the Optimal Seating Arrangement (OSA) as an Integer Linear Program and demonstrated that the problem can be efficiently solved by combining branch-and-bound and cutting plane methods. OSA refers
Externí odkaz:
https://doaj.org/article/fc39512ed7c544f9bce00ad2ef0562ca
Publikováno v:
Croatian Operational Research Review, Vol 6, Iss 1, Pp 79-89 (2015)
In the 1.5D terrain guarding problem, an x-monotone polygonal line is dened by k vertices and a G set of terrain points, i.e. guards, and a N set of terrain points which guards are to observe (guard). This involves a weighted version of the guarding
Externí odkaz:
https://doaj.org/article/2f739c37e2b2457aa813755aa7e8535d
Autor:
Damir Vukičević, Domagoj Matijević
Publikováno v:
Acta Biotheoretica. 71
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fdb0038f074f5af7f35294feb15bc96
https://doi.org/10.1007/s10441-023-09457-7
https://doi.org/10.1007/s10441-023-09457-7
Autor:
Domagoj Matijević, Domagoj Ševerdija
Publikováno v:
Osječki matematički list
Volume 10
Issue 1
Volume 10
Issue 1
Za dvije točke kažemo da vide jedna drugu ukoliko ne postoji prepreka koja bi presijecala segment koji ih spaja. Na temelju geometrijskog modela predstaviti ćmo klasične probleme vidljivosti kao šo su roblem galerije, problem utvrde i roblem ču
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______951::e104e9b762c4e47097fb0aa5fa97cbf9
https://hrcak.srce.hr/59280
https://hrcak.srce.hr/59280