Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Marko Boben"'
Publikováno v:
International Journal of Advanced Robotic Systems, Vol 10 (2013)
For successful operation in real-world environments, a mobile robot requires an effective spatial model. The model should be compact, should possess large expressive power and should scale well with respect to the number of modelled categories. In th
Externí odkaz:
https://doaj.org/article/bb0814ddeaf84e5cbd644a1d392225e8
Publikováno v:
CVPR
In order to learn to perform activities from demonstrations or descriptions, agents need to distill what the essence of the given activity is, and how it can be adapted to new environments. In this work, we address the problem: environment-aware prog
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba0e5f2921de9113e76b562311640fbe
https://doi.org/10.1109/cvpr.2019.00645
https://doi.org/10.1109/cvpr.2019.00645
Publikováno v:
Advances in Geometry. 15:393-408
We revisit the configuration DCD(4) of Danzer, a great inspiration for our work. This configuration of type (354) falls into an in_nite series of geometric point-line configurations DCD(n). Each DCD(n) is characterized combinatorially by having the K
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab7d7b90d0d1e8ebe9ab238bbc1a9c03
https://doi.org/10.1515/advgeom-2015-0019
https://doi.org/10.1515/advgeom-2015-0019
Publikováno v:
Computer Vision and Image Understanding. 138:102-113
We highlight the problem of poor discriminative power in hierarchical compositions.We combine generative hierarchical model with extracted discriminative features.We propose histogram of compositions (HoC) to capture discriminative features.HoC descr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57b448b6e1b2a36ba2957876e0bb1578
https://doi.org/10.1016/j.cviu.2015.04.006
https://doi.org/10.1016/j.cviu.2015.04.006
Publikováno v:
CVPR
arXiv
arXiv
In this paper, we are interested in modeling complex activities that occur in a typical household. We propose to use programs, i.e., sequences of atomic actions and interactions, as a high level representation of complex tasks. Programs are interesti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::250953856f4641124f2a61e3827feb0f
Publikováno v:
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry. 54:263-275
We investigate the existence of g-laterals in geometric and combinatorial configurations. First we can show that within a special family of configurations any of the eight possible combinations of the existence or non-existence of g-laterals for 3
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3013ee5b156265dbf904d6eb9c49b610
https://doi.org/10.1007/s13366-011-0065-3
https://doi.org/10.1007/s13366-011-0065-3
Autor:
Marko Boben
Publikováno v:
Discrete Mathematics. 307:331-344
Cubic bipartite graphs with girth at least 6 correspond to symmetric combinatorial (v"3) configurations. In 1887, Martinetti described a simple construction method which enables one to construct all combinatorial (v"3) configurations from a set of so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::400c15e6137822b9cc2656ca9673e714
https://doi.org/10.1016/j.disc.2006.07.015
https://doi.org/10.1016/j.disc.2006.07.015
Publikováno v:
CVPR
In this paper, we tackle the problem of unsupervised segmentation in the form of superpixels. Our main emphasis is on speed and accuracy. We build on [31] to define the problem as a boundary and topology preserving Markov random field. We propose a c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0983056e9685c7c8715159aad2719169
https://doi.org/10.1109/cvpr.2015.7298913
https://doi.org/10.1109/cvpr.2015.7298913
Publikováno v:
The Electronic Journal of Combinatorics. 22
Let $2 \leq k_1 < k_2 < \ldots < k_t $, $3 \leq g_1 < g_2 < \ldots < g_s < N$ be integer parameters. A $(k_1,k_2,\ldots,k_t;g_1,g_2,\dots,g_s;N)$-graph is a graph that contains vertices of degrees $k_1,k_2,\ldots,k_t$ but no other degrees and cycles
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08043ded3f2d6d610ed0d576bf9537a7
https://doi.org/10.37236/4680
https://doi.org/10.37236/4680
Publikováno v:
Journal of Combinatorial Designs. 13:406-424
We consider the class of I-graphs I(n,j,k), which is a generalization over the class of the generalized Petersen graphs. We study different properties of I-graphs, such as connectedness, girth, and whether they are bipartite or vertex-transitive. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9af718f4288c0384ed7842703a8e4916
https://doi.org/10.1002/jcd.20054
https://doi.org/10.1002/jcd.20054