Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Domagoj Ševerdija"'
Publikováno v:
Journal of Language Modelling, Vol 12, Iss 1 (2024)
All verbal forms in the Croatian language can be derived from two basic forms: the infinitive and the present stems. In this paper, we present a neural computation model that takes a verb in an infinitive form and finds a mapping to a present form. T
Externí odkaz:
https://doaj.org/article/a1e7f8bce6774a66841cdb7fae7efe5a
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 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:
Domagoj Ševerdija, Slobodan Jelić
Beside the same political and ideological attitudes, members of political parties can be interconnected on private and/or professional levels. We consider them as a part of one large social network. After the democratic elections, the total effective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e741d90c6b1527cb4714aee43f466d1f
https://doi.org/10.1007/s10100-017-0505-8
https://doi.org/10.1007/s10100-017-0505-8
Publikováno v:
Croatian Operational Research Review
Volume 6
Issue 1
Croatian Operational Research Review, Vol 6, Iss 1, Pp 79-89 (2015)
Volume 6
Issue 1
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 defined 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 guardin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c181f148cb7bc6a3247cf43924d79f50
https://hrcak.srce.hr/138580
https://hrcak.srce.hr/138580
In this paper we consider the 1.5D terrain guarding problem in which every point on the terrain that is to be covered has an integer demand associated with it. The goal is to find a minimum cardinality set of guards such that each point is guarded by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8348a83828008a35aeb5c0f2a3bae9ac
https://www.bib.irb.hr/631725
https://www.bib.irb.hr/631725
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
Publikováno v:
Scopus-Elsevier
We present a 4-approximation algorithm for the problem of placing the fewest guards on a 1.5D terrain so that every point of the terrain is seen by at least one guard. This improves on the previous best approximation factor of 5 (see King in Proceedi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d312ce91621de2172a6c760d56f8e4f1
https://inria.hal.science/inria-00359652
https://inria.hal.science/inria-00359652