Zobrazeno 1 - 10
of 213
pro vyhledávání: '"Brodnik Andrej"'
Publikováno v:
Slovenian Journal of Public Health, Vol 56, Iss 3, Pp 150-157 (2017)
Telemonitoring and web-based interventions are increasingly used in primary-care practices in many countries for more effective management of patients with diabetes mellitus (DM). A new approach in treating patients with diabetes mellitus in family p
Externí odkaz:
https://doaj.org/article/04f0a23ed08142afb8ad6acb6bcb91c6
We show an asymptotic 2/3-competitive strategy for the bin covering problem using O(b+log n) bits of advice, where b is the number of bits used to encode a rational value and n is the length of the input sequence.
Comment: 10 pages, 2 figure, su
Comment: 10 pages, 2 figure, su
Externí odkaz:
http://arxiv.org/abs/2309.13647
Autor:
Povsic, Jakob, Brodnik, Andrej
In the thesis we focus on designing an authentication system to authenticate users over a network with a username and a password. The system uses the zero-knowledge proof (ZKP) system as a password verification mechanism. The ZKP protocol used is bas
Externí odkaz:
http://arxiv.org/abs/2205.05847
Autor:
Brodnik, Andrej, Csizmadia, Andrew, Futschek, Gerald, Kralj, Lidija, Lonati, Violetta, Micheuz, Peter, Monga, Mattia
Computer programs are part of our daily life, we use them, we provide them with data, they support our decisions, they help us remember, they control machines, etc. Programs are made by people, but in most cases we are not their authors, so we have t
Externí odkaz:
http://arxiv.org/abs/2111.04887
The $d$-Simultaneous Conjugacy problem in the symmetric group $S_n$ asks whether there exists a permutation $\tau \in S_n$ such that $b_j = \tau^{-1}a_j \tau$ holds for all $j = 1,2,\ldots, d$, where $a_1, a_2,\ldots , a_d$ and $b_1, b_2,\ldots , b_d
Externí odkaz:
http://arxiv.org/abs/2007.05870
The transitive simultaneous conjugacy problem asks whether there exists a permutation $\tau \in S_n$ such that $b_j = \tau^{-1} a_j \tau$ holds for all $j = 1,2, \ldots, d$, where $a_1, a_2, \ldots, a_d$ and $b_1, b_2, \ldots, b_d$ are given sequence
Externí odkaz:
http://arxiv.org/abs/1907.07889
Autor:
Brodnik, Andrej, Jekovec, Matevž
We consider a sliding window $W$ over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We present an inde
Externí odkaz:
http://arxiv.org/abs/1801.07449
Autor:
Vičič, Jernej, Brodnik, Andrej
The manuscript presents an experiment at implementation of a Machine Translation system in a MapReduce model. The empirical evaluation was done using fully implemented translation systems embedded into the MapReduce programming model. Two machine tra
Externí odkaz:
http://arxiv.org/abs/1611.02944
Autor:
Jekovec, Matevž, Brodnik, Andrej
Efficient construction of the suffix tree given an input text is an active area of research from the time it was first introduced. Both theoretical computer scientists and engineers tackled the problem. In this paper we focus on the fastest practical
Externí odkaz:
http://arxiv.org/abs/1609.09654