Zobrazeno 1 - 10
of 194
pro vyhledávání: '"Janez Povh"'
Publikováno v:
Empirical Musicology Review, Vol 16, Iss 2, Pp 205-230 (2023)
We examine (ir)regularity in the musical structure of 736 monophonic children's folk songs from 22 European countries, by simulating and detecting (ir)regularity with the computational model, IDyOM, and our own algorithm, Ir_Reg, which classifies mel
Externí odkaz:
https://doaj.org/article/7bbc58a64e674c22931dd32dd45013a1
Publikováno v:
International Journal for Quality Research, Vol 16, Iss 2, Pp 375-394 (2022)
Advanced models, based on artificial intelligence and machine learning, are used here to analyze a bike-sharing system. The specific target was to predict the number of rented bikes in the Nova Mesto (Slovenia) public bike share scheme. For this purp
Externí odkaz:
https://doaj.org/article/dcc3379c9aae45abb31afdde6bca3fcd
Autor:
Noël Malod-Dognin, Julia Petschnigg, Sam F. L. Windels, Janez Povh, Harry Hemingway, Robin Ketteler, Nataša Pržulj
Publikováno v:
Nature Communications, Vol 10, Iss 1, Pp 1-13 (2019)
Integration of omics data remains a challenge. Here, the authors introduce iCell, a framework to integrate tissue-specific protein–protein interaction, co-expression and genetic interaction data, enabling identification of the most rewired genes in
Externí odkaz:
https://doaj.org/article/f16ba5ea82984765ad79c0f292ce025e
Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B
Autor:
Timotej Hrga, Janez Povh
Publikováno v:
Optimization Letters. 17:1201-1213
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::334a884396b31378f9b3858d6890d6fd
https://doi.org/10.1007/s11590-022-01944-z
https://doi.org/10.1007/s11590-022-01944-z
Autor:
Janez Povh
Publikováno v:
Mathematics, Vol 9, Iss 17, p 2030 (2021)
The graph bandwidth problem, where one looks for a labeling of graph vertices that gives the minimum difference between the labels over all edges, is a classical NP-hard problem that has drawn a lot of attention in recent decades. In this paper, we f
Externí odkaz:
https://doaj.org/article/2d58b4d5780742a0a1ac28838d491956
Publikováno v:
Central European Journal of Operations Research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::257820a58ba2b048c7f697e5767aa806
https://doi.org/10.1007/s10100-023-00844-6
https://doi.org/10.1007/s10100-023-00844-6
Autor:
Soodabeh Asadi, Janez Povh
Publikováno v:
Mathematics, Vol 9, Iss 5, p 540 (2021)
This article uses the projected gradient method (PG) for a non-negative matrix factorization problem (NMF), where one or both matrix factors must have orthonormal columns or rows. We penalize the orthonormality constraints and apply the PG method via
Externí odkaz:
https://doaj.org/article/d164c7c0a1b44e989c550331498ae31a
Publikováno v:
Journal of Engineering Design. 33:144-170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b527a349488477e3774166fdd06edfa9
https://doi.org/10.1080/09544828.2021.2012133
https://doi.org/10.1080/09544828.2021.2012133
Publikováno v:
Mathematics, Vol 8, Iss 11, p 2050 (2020)
The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k≥3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al., in: G
Externí odkaz:
https://doaj.org/article/6285a8cf440d4079bb5daa0f3a4d4ae1
Autor:
Janez Povh
Publikováno v:
Croatian Operational Research Review, Vol 5, Iss 2, Pp 105-117 (2014)
In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem. We demonstrate how to write a quadratic optimization problem over discrete feasible set a
Externí odkaz:
https://doaj.org/article/f3518c7452d045159712c31b87998f31