Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Ozoliņš, Emīls"'
Integer factorization is a famous computational problem unknown whether being solvable in the polynomial time. With the rise of deep neural networks, it is interesting whether they can facilitate faster factorization. We present an approach to factor
Externí odkaz:
http://arxiv.org/abs/2309.05295
There has been a growing number of machine learning methods for approximately solving the travelling salesman problem. However, these methods often require solved instances for training or use complex reinforcement learning approaches that need a lar
Externí odkaz:
http://arxiv.org/abs/2207.13667
Recurrent neural networks have flourished in many areas. Consequently, we can see new RNN cells being developed continuously, usually by creating or using gates in a new, original way. But what if we told you that gates in RNNs are redundant? In this
Externí odkaz:
http://arxiv.org/abs/2108.00527
Autor:
Ozolins, Emils, Freivalds, Karlis, Draguns, Andis, Gaile, Eliza, Zakovskis, Ronalds, Kozlovics, Sergejs
Modern neural networks obtain information about the problem and calculate the output solely from the input values. We argue that it is not always optimal, and the network's performance can be significantly improved by augmenting it with a query mecha
Externí odkaz:
http://arxiv.org/abs/2106.07162
Convolutional neural networks have become the main tools for processing two-dimensional data. They work well for images, yet convolutions have a limited receptive field that prevents its applications to more complex 2D tasks. We propose a new neural
Externí odkaz:
http://arxiv.org/abs/2006.15892
Attention is a commonly used mechanism in sequence processing, but it is of O(n^2) complexity which prevents its application to long sequences. The recently introduced neural Shuffle-Exchange network offers a computation-efficient alternative, enabli
Externí odkaz:
http://arxiv.org/abs/2004.04662
A key requirement in sequence to sequence processing is the modeling of long range dependencies. To this end, a vast majority of the state-of-the-art models use attention mechanism which is of O($n^2$) complexity that leads to slow execution for long
Externí odkaz:
http://arxiv.org/abs/1907.07897
Autor:
Ozoliņš, Emīls
Kombinatorās optimizācijas problēmām ir liela praktiskā nozīme, tomēr tās, parasti, ir NP-grūtas un to risināšana ir apgrūtināta. Darba mērķis ir noskaidrot, vai dziļo neironu tīklu metodes var tikt pielietotas kombinatorai optimizā
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2360::97d20bad45f9b1cc1f4a9107fd0f235a
https://dspace.lu.lv/dspace/handle/7/59989
https://dspace.lu.lv/dspace/handle/7/59989
Autor:
Ozoliņš, Emīls
Mūsdienu neironu tīklu modeļiem efektīva tālu atkarību modelēšana sagādā problēmas. Īpaši izteikta šī problēma ir algoritmiskiem uzdevumiem, tomēr arī citos uzdevumos tā sagādā grūtības un noved pie daudzu uzdevuma-specifisku m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2360::00bdafdaf7313fdab58bed5ed0178f9a
https://dspace.lu.lv/dspace/handle/7/51705
https://dspace.lu.lv/dspace/handle/7/51705
Autor:
Ozoliņš, Emīls
Kvalifikācijas darbs „Mobilā grāmatu koplietošanas sistēma” apraksta sistēmas prasības, izmantotās tehnoloģijas un sistēmas struktūru. Izstrādātā sistēma ir servera puses programmatūra, kas paredzēta lietošanai ar viedtālruņa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2360::28a358442337a79dcc6bfedb9165ab94
https://dspace.lu.lv/dspace/handle/7/39700
https://dspace.lu.lv/dspace/handle/7/39700