Zobrazeno 1 - 10
of 716
pro vyhledávání: '"Studeny A"'
Autor:
Studený, Milan
Five different ways of combinatorial description of non-empty faces of the cone of supermodular functions on the power set of a finite basic set $N$ are introduced. Their identification with faces of the cone of supermodular games allows one to assoc
Externí odkaz:
http://arxiv.org/abs/2410.19454
Autor:
Dhar, Anubhav, Kujawa, Eli, Lievonen, Henrik, Modanese, Augusto, Muftuoglu, Mikail, Studený, Jan, Suomela, Jukka
The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models: - the classical LOCAL model of distributed graph algorithms, - the quantum version of the LOCAL model, - finitely dependent d
Externí odkaz:
http://arxiv.org/abs/2409.13795
In prior work, Gupta et al. (SPAA 2022) presented a distributed algorithm for multiplying sparse $n \times n$ matrices, using $n$ computers. They assumed that the input matrices are uniformly sparse--there are at most $d$ non-zeros in each row and co
Externí odkaz:
http://arxiv.org/abs/2404.15559
We introduce an algebraic concept of the frame for abstract conditional independence (CI) models, together with basic operations with respect to which such a frame should be closed: copying and marginalization. Three standard examples of such frames
Externí odkaz:
http://arxiv.org/abs/2402.14053
Autor:
Gupta, Chetan, Latypov, Rustam, Maus, Yannic, Pai, Shreyas, Särkkä, Simo, Studený, Jan, Suomela, Jukka, Uitto, Jara, Vahidi, Hossein
We present a deterministic algorithm for solving a wide range of dynamic programming problems in trees in $O(\log D)$ rounds in the massively parallel computation model (MPC), with $O(n^\delta)$ words of local memory per machine, for any given consta
Externí odkaz:
http://arxiv.org/abs/2305.03693
Autor:
Yun Min Klimesova, Martina Nemcokova, Magdalena Netukova, Alina-Dana Baxant, Marcela Hlavackova, Jana Kacerovska, Pavel Studeny
Publikováno v:
Biomedical Papers, Vol 168, Iss 1, Pp 55-61 (2024)
Purpose. To evaluate the safety and efficacy of using corneal stromal lenticules (CSLs) obtained during refractive surgery Refractive Lenticule Extraction (ReLEx) with the Small Incision Lenticule Extraction (SMILE) procedure for the treatment of cor
Externí odkaz:
https://doaj.org/article/a762f07e64264f43b67d426b69d318a9
Publikováno v:
BMJ Open Ophthalmology, Vol 9, Iss Suppl 3 (2024)
Externí odkaz:
https://doaj.org/article/9debd1bd50c74bd287d9095ee8ffddcd
We study matrix multiplication in the low-bandwidth model: There are $n$ computers, and we need to compute the product of two $n \times n$ matrices. Initially computer $i$ knows row $i$ of each input matrix. In one communication round each computer c
Externí odkaz:
http://arxiv.org/abs/2203.01297
Autor:
Balliu, Alkida, Brandt, Sebastian, Chang, Yi-Jun, Olivetti, Dennis, Studený, Jan, Suomela, Jukka
We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\Theta(\log n), \Theta(n)]$ region, in two settings. We present one algorithm for unr
Externí odkaz:
http://arxiv.org/abs/2202.08544
Autor:
Balliu, Alkida, Korhonen, Janne H., Kuhn, Fabian, Lievonen, Henrik, Olivetti, Dennis, Pai, Shreyas, Paz, Ami, Rybicki, Joel, Schmid, Stefan, Studený, Jan, Suomela, Jukka, Uitto, Jara
The sinkless orientation problem plays a key role in understanding the foundations of distributed computing. The problem can be used to separate two fundamental models of distributed graph algorithms, LOCAL and SLOCAL: the locality of sinkless orient
Externí odkaz:
http://arxiv.org/abs/2108.02655