Related papers: Reflect-Push Methods Part I: Two Dimensional Techn…
Lifting is an efficient technique to scale up graphical models generalized to relational domains by exploiting the underlying symmetries. Concurrently, neural models are continuously expanding from grid-like tensor data into structured…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
We study in this paper compression effects in heterogeneous media with maximal packing constraint. Starting from compressible Brinkman equations, where maximal packing is encoded in a singular pressure and a singular bulk viscosity, we show…
We investigate the community detection problem on graphs in the existence of multiple edge types. Our main motivation is that similarity between objects can be defined by many different metrics and aggregation of these metrics into a single…
We study the problem of multi-compression and reconstructing a stochastic signal observed by several independent sensors (or compressors) that transmit compressed information to a fusion center. { The key aspect of this problem is to find…
We study how good a lexicographically maximal solution is in the weighted matching and matroid intersection problems. A solution is lexicographically maximal if it takes as many heaviest elements as possible, and subject to this, it takes…
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…
A novel perturbative method, proposed by Panda {\it et al.} [1] to solve the Helmholtz equation in two dimensions, is extended to three dimensions for general boundary surfaces. Although a few numerical works are available in the literature…
Consider a reflected diffusion on the positive half-line. We approximate it by solutions of stochastic differential equations using the penalty method: We emulate the "hard barrier" of reflection by a "soft barrier" of a large drift…
In our recent work [22], a family of high order asymptotic preserving (AP) methods, termed as IMEX-LDG methods, are designed to solve some linear kinetic transport equations, including the one-group transport equation in slab geometry and…
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
All-dielectric nanostructures have recently emerged as a promising alternative to plasmonic devices, as they also possess pronounced electric and magnetic resonances and allow effective light manipulation. In this work, we study optical…
This work proposes to reduce visibility data volume using a baseline-dependent lossy compression technique that preserves smearing at the edges of the field-of-view. We exploit the relation of the rank of a matrix and the fact that a…
This paper is concerned with developing accurate and efficient numerical methods for fully nonlinear second order elliptic and parabolic partial differential equations (PDEs) in multiple spatial dimensions. It presents a general framework…
Given $E \subset \mathbb{R}^d$, $d \ge 2$, define ${\mathcal D}(E) \equiv {(x-y)/|x-y|: x,y \in E} \subset S^{d-1},$ the set of directions determined by $E$. We prove that if the Hausdorff dimension of $E$ is greater than $d-1$, then…
High-resolution seismic reflections are essential for imaging and monitoring applications. In seismic land surveys using sources and receivers at the surface, surface waves often dominate, masking the reflections. In this study, we…
We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…
We consider the statistical problem of recovering a hidden "ground truth" binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurements. We present new algorithms and a sharp finite-sample…
We consider the statistical inverse problem of recovering a parameter $\theta\in H^\alpha$ from data arising from the Gaussian regression problem \begin{equation*} Y = \mathscr{G}(\theta)(Z)+\varepsilon \end{equation*} with nonlinear…
We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…