Zobrazeno 1 - 10
of 4 249
pro vyhledávání: '"Halldórsson"'
Autor:
Halldorsson, Steinar
Phleboviruses are emerging zoonotic pathogens which constitute a global threat to human and animal health. The mosquito-borne Rift Valley fever virus (RVFV) is a widespread problem across the African continent and causes regular deadly outbreaks in r
Externí odkaz:
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.757716
Autor:
Halldorsson, Brynjar
Excessive Reassurance Seeking (ERS) is an under-researched and poorly understood behaviour that resembles the compulsive behaviours that are typically seen in obsessional problems. ERS can be complex, persistent, extensive, debilitating and may domin
Externí odkaz:
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.646143
Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph $H$ to be colored is locally embedded within the communication graph $G$. Besides generalizing classical di
Externí odkaz:
http://arxiv.org/abs/2408.11041
Publikováno v:
Soil Dynamics and Earthquake Engineering, Volume 183, 2024, 108798, ISSN 0267-7261
Seismic wave amplification due to localized site conditions is an important aspect of regional seismic hazard assessment. Without systematic studies of frequency-dependent site-effects during strong Icelandic earthquakes, various local site proxies o
Externí odkaz:
http://arxiv.org/abs/2407.09338
Autor:
Maus, Yannic, Halldórsson, Magnús M.
We consider the problem of coloring graphs of maximum degree $\Delta$ with $\Delta$ colors in the distributed setting with limited bandwidth. Specifically, we give a $\mathsf{poly}\log\log n$-round randomized algorithm in the CONGEST model. This is c
Externí odkaz:
http://arxiv.org/abs/2405.09975
Graph coloring is fundamental to distributed computing. We give an ultrafast distributed algorithm for coloring cluster graphs. These graphs are obtained from the underlying communication network by contracting nodes and edges, and they appear freque
Externí odkaz:
http://arxiv.org/abs/2405.07725
The constructive Lov\'{a}sz Local Lemma has become a central tool for designing efficient distributed algorithms. While it has been extensively studied in the classic LOCAL model that uses unlimited bandwidth, much less is known in the bandwidth-rest
Externí odkaz:
http://arxiv.org/abs/2405.07353
Autor:
Benedikt A. Jónsson, Gísli H. Halldórsson, Steinþór Árdal, Sölvi Rögnvaldsson, Eyþór Einarsson, Patrick Sulem, Daníel F. Guðbjartsson, Páll Melsted, Kári Stefánsson, Magnús Ö. Úlfarsson
Publikováno v:
Communications Biology, Vol 7, Iss 1, Pp 1-9 (2024)
Abstract Mutations that affect RNA splicing significantly impact human diversity and disease. Here we present a method using transformers, a type of machine learning model, to detect splicing from raw 45,000-nucleotide sequences. We generate embeddin
Externí odkaz:
https://doaj.org/article/edb255f68b4b469996e1fb41ad38a6e0
