Výsledky vyhledávání - "Janne H. Korhonen"

Fast approximate shortest paths in the congested clique

Autor: Michal Dory, Janne H. Korhonen, Keren Censor-Hillel, Dean Leitersdorf

Publikováno v: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
PODC
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing-PODC 19
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing-PODC '19

We design fast deterministic algorithms for distance computation in the Congested Clique model. Our key contributions include: A $$(2+\epsilon )$$ ( 2 + ϵ ) -approximation for all-pairs shortest paths in $$O(\log ^2{n} / \epsilon )$$ O ( log 2 n / �

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b54299e6af464556cfd284cb947eb802
https://doi.org/10.1007/s00446-020-00380-5

Zobrazit plný text záznamu

Input-Dynamic Distributed Algorithms for Communication Networks

Autor: Stefan Schmid, Ami Paz, Klaus-Tycho Foerster, Joel Rybicki, Janne H. Korhonen

Publikováno v: SIGMETRICS (Abstracts)
Proceedings of the ACM on Measurement and Analysis of Computing Systems

Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an e

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac90852091b6abd4dcfee47d6b3e62d5

Zobrazit plný text záznamu

Does Preprocessing Help under Congestion?

Autor: Janne H. Korhonen, Stefan Schmid, Klaus-Tycho Foerster, Joel Rybicki

Publikováno v: PODC

This paper investigates the power of preprocessing in the CONGEST model. Schmid and Suomela (ACM HotSDN 2013) introduced the SUPPORTED CONGEST model to study the application of distributed algorithms in Software-Defined Networks (SDNs). In this paper

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::491fa1daee28793b4b5d2d566b0fa3e0
https://doi.org/10.1145/3293611.3331581

Zobrazit plný text záznamu

Fast motif matching revisited: high-order PWMs, SNPs and indels

Autor: Kimmo Palin, Jussi Taipale, Janne H. Korhonen, Esko Ukkonen

Publikováno v: Bioinformatics. 33:514-521

Motivation While the position weight matrix (PWM) is the most popular model for sequence motifs, there is growing evidence of the usefulness of more advanced models such as first-order Markov representations, and such models are also becoming availab

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e75c3183a728d0db777344589c55c10
https://doi.org/10.1093/bioinformatics/btw683

Zobrazit plný text záznamu

Synchronous counting and computational algorithm design

Autor: Keijo Heljanko, Christoph Lenzen, Jukka Suomela, Matti Järvisalo, Joel Rybicki, Danny Dolev, Siert Wieringa, Janne H. Korhonen

Publikováno v: JOURNAL OF COMPUTER AND SYSTEM SCIENCES. 82(2):310-332

Consider a complete communication network on $n$ nodes, each of which is a state machine. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses are "odd" and which are "even". We require that the sol

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f39fbd20df8b4b32d12d8f75c41e499f
http://juuli.fi/Record/0281959416

Zobrazit plný text záznamu

Inferring dispersal across a fragmented landscape using reconstructed families in the Glanville fritillary butterfly

Autor: Michelle F. DiLeo, Ilkka Hanski, Torsti Schulz, Toby Fountain, Etsuko Nonaka, Arild Husby, Janne H. Korhonen, Marjo Saastamoinen, Pasi Rastas

Dispersal is important for determining both species ecological processes, such as population viability, and its evolutionary processes, like gene flow and local adaptation. Yet obtaining accurate estimates in the wild through direct observation can b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19666f36fcbae74806dd9295eb9ec2bf
http://hdl.handle.net/10138/234723

Zobrazit plný text záznamu

Towards a complexity theory for the congested clique

Autor: Jukka Suomela, Janne H. Korhonen

Publikováno v: SPAA

The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ceb01b580a2a19d74c303408bfa401e
http://arxiv.org/abs/1705.03284

Zobrazit plný text záznamu

Bayesian Network Structure Learning with Integer Programming : Polytopes, Facets and Complexity (Extended Abstract)

Autor: James Cussens, Janne H. Korhonen, Matti Järvisalo, Mark Bartlett

Publikováno v: IJCAI

Developing accurate algorithms for learning structures of probabilistic graphical models is an important problem within modern AI research. Here we focus on score-based structure learning for Bayesian networks as arguably the most central class of gr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::009bc8fa659a6cfc00a070b648288129
http://hdl.handle.net/10138/309171

Zobrazit plný text záznamu

LCL problems on grids

Autor: Christopher Purcell, Juho Hirvonen, Joel Rybicki, Przemyslaw Uznanski, Patric R. J. Östergård, Sebastian Brandt, Tuomo Lempiäinen, Jukka Suomela, Janne H. Korhonen

Publikováno v: PODC

LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2e4ce68986f6916b220e9be499daa8a

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání