Related papers: A parallel algorithm for the enumeration of benzen…
Data from future high-precision Cosmic Microwave Background (CMB) measurements will be sensitive to the primordial Helium abundance $Y_p$. At the same time, this parameter can be predicted from Big Bang Nucleosynthesis (BBN) as a function…
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the $BL$ variant, processes can choose in each round either to beep or to listen. Those who beep are unable to…
The $hp$-adaptive finite element method (FEM) - where one independently chooses the mesh size ($h$) and polynomial degree ($p$) to be used on each cell - has long been known to have better theoretical convergence properties than either $h$-…
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k>2, our algorithms for…
The life of the modern world essentially depends on the work of the large artificial homogeneous networks, such as wired and wireless communication systems, networks of roads and pipelines. The support of their effective continuous…
We report on an extended version of the one-dimensional model proposed by Constant \emph{et al.} [Phys. Rev. Lett 82(8), 1668 (1999)] to study phase matching of high-order harmonic generation in absorbing and dispersive medium. The model -…
This paper is devoted to computational algorithms designed to describe the classical Ising magnet in some specific cases when an additional macroscopic restriction in form of constant charge density exists in the system. We developed and…
We study the efficiency of an improved Multiboson algorithm with two flavours of Wilson fermions in a realistic physical situation ($\beta = 5.60$, $\kappa = 0.156$ on a $16^3 \times 24$ lattice). The performance of this exact algorithm is…
We present a Bayesian graph neural network (BGNN) that can estimate the weak lensing convergence ($\kappa$) from photometric measurements of galaxies along a given line of sight. The method is of particular interest in strong gravitational…
We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zonotope's vertices by sampling a random linear combination of…
Calculation of Bayesian posteriors and model evidences typically requires numerical integration. Bayesian quadrature (BQ), a surrogate-model-based approach to numerical integration, is capable of superb sample efficiency, but its lack of…
We calculate the differential branching fraction, lepton forward-backward asymmetry and direct CP asymmetry for $B_{d,s}\to\gamma\ell\bar{\ell}$ decays with an energetic photon. We employ factorization methods, which result in rigorous…
We present a computation of B-meson decay constants from lattice QCD simulations within the framework of Heavy Quark Effective Theory for the b-quark. The next-to-leading order corrections in the HQET expansion are included…
\emph{$K$-best enumeration}, which asks to output $k$-best solutions without duplication, is a helpful tool in data analysis for many fields. In such fields, graphs typically represent data. Thus subgraph enumeration has been paid much…
As datasets continue to increase in size and multi-core computer architectures are developed, asynchronous parallel optimization algorithms become more and more essential to the field of Machine Learning. Unfortunately, conducting the…
Improved results for $B_K$ are discussed. Scaling corrections are argued to be of $O(a^2)$, leading to a reduction in the systematic error. For a kaon composed of degenerate quarks, the quenched result is ${\widehat{B}_K} = 0.825 \pm 0.027…
The identification of homologous gene families across multiple genomes is a central task in bacterial pangenomics traditionally requiring computationally demanding all-against-all comparisons. PanDelos addresses this challenge with an…
A linear extension of a poset $P$ is a permutation of the elements of the set that respects the partial order. Let $L(P)$ denote the number of linear extensions. It is a #P complete problem to determine $L(P)$ exactly for an arbitrary…
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with probability density estimates. Then, a geometrical…
We provide a straightforward and numerically efficient procedure to perform local density approximation + Hubbard I (LDA+HIA) calculations, including self-consistency over the charge density, within the full potential linearized augmented…