Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Uros Cibej"'
Autor:
Jurij Mihelič, Uros Cibej
Publikováno v:
Open Computer Science, Vol 11, Iss 1, Pp 51-59 (2020)
Detecting automorphisms is a natural way to identify redundant information presented in structured data. When such redundancies are detected they can be used for data compression. In this paper we explore two different classes of graphs to capture th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb29dcb34976da64c8a7ad1e2f1427a9
https://doi.org/10.1515/comp-2020-0186
https://doi.org/10.1515/comp-2020-0186
Autor:
Uros Cibej, Jurij Mihelič
Publikováno v:
Acta Electrotechnica et Informatica, Vol 18, Iss 4, Pp 3-10 (2019)
This article addresses the problem of finding patterns in graphs. This is formally defined as the subgraph isomorphism problem and is one of the core problems in theoretical computer science. We consider the counting variation of this problem. The ta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc596afb2cc4737c9da781da43712e84
http://www.aei.tuke.sk/papers/2018/4/01_Cibej.pdf
http://www.aei.tuke.sk/papers/2018/4/01_Cibej.pdf
Autor:
Jurij Mihelič, Uros Cibej
Publikováno v:
Acta Electrotechnica et Informatica, Vol 18, Iss 3, Pp 47-56 (2018)
In this paper we draw our attention to several algorithms for the dataflow computer paradigm, where the dataflow computation is used to augment the classical control-flow computation and, hence, strives to obtain an accelerated algorithm. Our main go
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::050c00c0908d64e25779c1a1bb82e90e
https://doi.org/10.15546/aeei-2018-0025
https://doi.org/10.15546/aeei-2018-0025
Autor:
Uros Cibej, Jurij Mihelič
Publikováno v:
2019 IEEE 15th International Scientific Conference on Informatics.
A well-known $\mathcal{N}\mathcal{P}$-hard problem from graph theory is the subgraph isomorphism problem where the goal is for given pattern and target graphs to determine whether the pattern is a subgraph of the target graph. A plethora of algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18f1261d9e6d2365966a7c926eb77e02
https://doi.org/10.1109/informatics47936.2019.9119286
https://doi.org/10.1109/informatics47936.2019.9119286
Autor:
Jurij Mihelič, Uros Cibej
Publikováno v:
2019 IEEE 15th International Scientific Conference on Informatics.
Symmetries are a convenient way to describe redundancies in data. This article presents two novel classes of graphs which can be represented in a compressed format using symmetries. We denote the first class as symmetry-compressible graphs where glob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::789269c8ceafe622d05857204aea94e9
https://doi.org/10.1109/informatics47936.2019.9119294
https://doi.org/10.1109/informatics47936.2019.9119294
Publikováno v:
Symmetry
Volume 11
Issue 10
Symmetry, Vol 11, Iss 10, p 1300 (2019)
Symmetry, vol. 11, no. 10, 1300, 2019.
Volume 11
Issue 10
Symmetry, Vol 11, Iss 10, p 1300 (2019)
Symmetry, vol. 11, no. 10, 1300, 2019.
We introduce a new equivalence on graphs, defined by its symmetry-breaking capability. We first present a framework for various backtracking search algorithms, in which the equivalence is used to prune the search tree. Subsequently, we define the equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa3e87d27b67a5a24c737da5ab739499
Publikováno v:
Journal of Microscopy. 260:107-116
Cell counting in microscopic images is one of the fundamental analysis tools in life sciences, but is usually tedious, time consuming and prone to human error. Several programs for automatic cell counting have been developed so far, but most of them
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f425166b34f0d2b811c00d18c966649
https://doi.org/10.1111/jmi.12272
https://doi.org/10.1111/jmi.12272
Autor:
Jurij Mihelič, Uros Cibej
Publikováno v:
2017 IEEE 14th International Scientific Conference on Informatics.
Subgraph isomorphism is one of the fundamental search problems in computer science. In this article we consider the counting variation of this problem. The task is to count all instances of the pattern G occurring in a (usually larger) graph H. All a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04c46f72d1567fde4e3bb4c7c0a123d9
https://doi.org/10.1109/informatics.2017.8327222
https://doi.org/10.1109/informatics.2017.8327222
Autor:
Uros Cibej, Jurij Mihelič
Publikováno v:
2017 IEEE 14th International Scientific Conference on Informatics.
In this paper we focus on algorithms that extend classical control-flow computation with a dataflow computing paradigm. In particular, our goal is to experimentally explore various dataflow techniques and features, which enable the acceleration of al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bcb027f2adb135a7401093342ed4803
https://doi.org/10.1109/informatics.2017.8327258
https://doi.org/10.1109/informatics.2017.8327258
Autor:
Uros Cibej, Jurij Mihelič
Publikováno v:
DCC
This article describes an alternative representation of graphs, using symmetries. We define the class of graphs that are compressed using this representation as symmetry-compressible graphs. This class of graphs is extended into the class of near sym
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10a6ba1e3783012da76634818f2e5331
https://doi.org/10.1109/dcc.2017.20
https://doi.org/10.1109/dcc.2017.20