Zobrazeno 1 - 10
of 226
pro vyhledávání: '"Wild, Sebastian"'
Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationships have different needs. We formally define and study the underlying op
Externí odkaz:
http://arxiv.org/abs/2403.00465
In the multiple-selection problem one is given an unsorted array $S$ of $N$ elements and an array of $q$ query ranks $r_1<\cdots
Externí odkaz:
http://arxiv.org/abs/2402.17631
In past work (Onokpasa, Wild, Wong, DCC 2023), we showed that (a) for joint compression of RNA sequence and structure, stochastic context-free grammars are the best known compressors and (b) that grammars which have better compression ability also sh
Externí odkaz:
http://arxiv.org/abs/2401.16623
A \emph{saddlepoint} of an $n \times n$ matrix is an entry that is the maximum of its row and the minimum of its column. Saddlepoints give the \emph{value} of a two-player zero-sum game, corresponding to its pure-strategy Nash equilibria; efficiently
Externí odkaz:
http://arxiv.org/abs/2401.06512
A saddlepoint of an $n \times n$ matrix $A$ is an entry of $A$ that is a maximum in its row and a minimum in its column. Knuth (1968) gave several different algorithms for finding a saddlepoint. The worst-case running time of these algorithms is $\Th
Externí odkaz:
http://arxiv.org/abs/2310.16801
In this paper, we use the biological domain knowledge incorporated into stochastic models for ab initio RNA secondary-structure prediction to improve the state of the art in joint compression of RNA sequence and structure data (Liu et al., BMC Bioinf
Externí odkaz:
http://arxiv.org/abs/2302.11669
Publikováno v:
ALENEX 2023
We present a stable mergesort variant, Multiway Powersort, that exploits existing runs and finds nearly-optimal merging orders for k-way merges with negligible overhead. This builds on Powersort (Munro & Wild, ESA2018), which has recently replaced Ti
Externí odkaz:
http://arxiv.org/abs/2209.06909
We study constant-cost randomized communication problems and relate them to implicit graph representations in structural graph theory. Specifically, constant-cost communication problems correspond to hereditary graph families that admit constant-size
Externí odkaz:
http://arxiv.org/abs/2111.03639
Pinwheel Scheduling aims to find a perpetual schedule for unit-length tasks on a single machine subject to given maximal time spans (a.k.a. frequencies) between any two consecutive executions of the same task. The density of a Pinwheel Scheduling ins
Externí odkaz:
http://arxiv.org/abs/2111.01784
Autor:
The GAMBIT Collaboration, Athron, Peter, Kozar, Neal Avis, Balázs, Csaba, Beniwal, Ankit, Bloor, Sanjay, Bringmann, Torsten, Brod, Joachim, Chang, Christopher, Cornell, Jonathan M., Farmer, Ben, Fowlie, Andrew, Gonzalo, Tomás E., Handley, Will, Kahlhoefer, Felix, Kvellestad, Anders, Mahmoudi, Farvah, Prim, Markus T., Raklev, Are, Renk, Janina J., Scaffidi, Andre, Scott, Pat, Stöcker, Patrick, Vincent, Aaron C., White, Martin, Wild, Sebastian, Zupan, Jure
Publikováno v:
Eur. Phys. J. C 81, 992 (2021)
We assess the status of a wide class of WIMP dark matter (DM) models in light of the latest experimental results using the global fitting framework $\textsf{GAMBIT}$. We perform a global analysis of effective field theory (EFT) operators describing t
Externí odkaz:
http://arxiv.org/abs/2106.02056