Related papers: Solving peak overlaps for proximity histogram anal…
In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upper-bound [17,5,11,8]. In this paper, we introduce the $\Pi$-Packing with $\alpha()$-Overlap problem to allow for…
Subgraph isomorphism, also known as subgraph matching, is typically regarded as an NP-complete problem. This complexity is further compounded in practical applications where edge weights are real-valued and may be affected by measurement…
Doping impurity atoms is a strategy commonly used to tune the functionality of materials including catalysts, semiconductors, and quantum emitters. The location of dopants and their interaction with surrounding atoms could significantly…
Quantum computing promises solutions to classically difficult and new-found problems through controlling the subtleties of quantum computing. The Quantum Approximate Optimisation Algorithm (QAOA) is a recently proposed quantum algorithm…
Multiscale mixed methods based on non-overlapping domain decompositions can efficiently handle the solution of significant subsurface flow problems in very heterogeneous formations of interest to the industry, especially when implemented on…
Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…
In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…
We consider numerical solution of elliptic problems with heterogeneous diffusion coefficients containing thin highly conductive structures. Such problems arise e.g. in fractured porous media, reinforced materials, and electric circuits. The…
Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic optimization problems…
Consider the problem of inverse scattering of time-harmonic point sources from an infinite, penetrable rough interface with bounded obstacles buried in the lower half-space, where the interface is assumed to be a local perturbation of a…
In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More…
We propose an algorithm for generating explicit solutions of multiparametric mixed-integer convex programs to within a given suboptimality tolerance. The algorithm is applicable to a very general class of optimization problems, but is most…
Building upon the concept of utilizing quasi-parabolic approximations to determine plasma frequency profiles from ionograms, we present a refined multi-quasi-parabolic method for modeling the E and F layers. While a recent study AIP…
Shack-Hartmann wavefront sensing relies on accurate spot centre measurement. Several algorithms were developed with this aim, mostly focused on precision, i.e. minimizing random errors. In the solar and extended scene community, the…
A plasma impedance probe (PIP) is a type of in-situ, radio-frequency (RF) probe that is traditionally used to measure plasma properties (e.g. density) in low-density environments such as the Earth's ionosphere. We believe that PIPs are…
With the development of affordable aberration-correctors, analytical scanning transmission electron microscopy (STEM) studies of complex interfaces can now be conducted at high spatial resolution at laboratories worldwide. Energy-dispersive…
Graphs provide a natural way to represent data by encoding information about objects and the relationships between them. With the ever-increasing amount of data collected and generated, locating specific patterns of relationships between…
We introduce a new method, rooted in estimation theory, to detect individual atoms in site-resolved images of microtrap arrays, such as optical lattices or optical tweezers arrays. Using labelled test images, we demonstrate drastic…
We focus on the problem of identifying samples in a set that do not conform to structured patterns represented by low-dimensional manifolds. An effective way to solve this problem is to embed data in a high dimensional space, called…
Graph representations of solid state materials that encode only interatomic distance lack geometrical resolution, resulting in degenerate representations that may map distinct structures to equivalent graphs. Here we propose a hypergraph…