Related papers: Generating $N$-point spherical configurations with…
We develop a new approach for clustering non-spherical (i.e., arbitrary component covariances) Gaussian mixture models via a subroutine, based on the sum-of-squares method, that finds a low-dimensional separation-preserving projection of…
We propose a method for generating nodes for kernel quadrature by a point-wise gradient descent method. For kernel quadrature, most methods for generating nodes are based on the worst case error of a quadrature formula in a reproducing…
Many disciplines of science and engineering deal with problems related to compositions, ranging from chemical compositions in materials science to portfolio compositions in economics. They exist in non-Euclidean simplex spaces, causing many…
Large-scale numerical computations make increasing use of low-precision (LP) floating point formats and mixed precision arithmetic, which can be enhanced by the technique of stochastic rounding (SR), that is, rounding an intermediate…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
A fundamental challenge in text-to-3D face generation is achieving high-quality geometry. The core difficulty lies in the arbitrary and intricate distribution of vertices in 3D space, making it challenging for existing models to establish…
The existing combinatorial methods for iso-surface computation are efficient for pure visualization purposes, but it is known that the resulting iso-surfaces can have holes, and topological problems like missing or wrong connectivity can…
Satellite networks are emerging as vital solutions for global connectivity beyond 5G. As companies such as SpaceX, OneWeb, and Amazon are poised to launch a large number of satellites in low Earth orbit, the heightened inter-satellite…
We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in…
Skew-spectra allow us to extract non-Gaussian information by taking the square of a map and finding the power spectrum of this new map with the original map. This allows us to use much of the infrastructure of power spectra and avoid the…
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…
In this paper, we propose a low-rank coordinate descent approach to structured semidefinite programming with diagonal constraints. The approach, which we call the Mixing method, is extremely simple to implement, has no free parameters, and…
In this paper, we propose a method to build molecular cages designed to capture a specific substrate. We model a cage as a graph of atoms with coordinates in space, and several constraints on their edges (degree, length and angle). We use a…
As details are missing in most representations of structures, the lack of controllability to more information is one of the major weaknesses in structure-based controllable point cloud generation. It is observable that definitions of…
We study the statistics of peaks in a weak lensing reconstructed mass map of the first 450 square degrees of the Kilo Degree Survey. The map is computed with aperture masses directly applied to the shear field with an NFW-like compensated…
For $N$-point best-packing configurations $\omega_N$ on a compact metric space $(A,\rho)$, we obtain estimates for the mesh-separation ratio $\gamma(\omega_N,A)$, which is the quotient of the covering radius of $\omega_N$ relative to $A$…
We introduce a simple representation for isotropic spherical random fields and we discuss how it allows to discuss different notions of sparsity under isotropy. We also show how a suitable construction of sparse fields can mimic well the…
The variational grid generation method is a powerful tool for generating structured convex grids on irregular simply connected domains whose boundary is a polygonal Jordan curve. Several examples that show the accuracy of a difference…
In this paper, we study conditions under which a finite subset $Z$ of the unit sphere $S^{d-1}\subset \mathbb{R}^{d}$ becomes a spherical $t$-design, when $Z$ is constructed by the following procedure: starting from a finite set of…
We introduce a simple spherical model whose structural properties are similar to the ones generated by models with directional interactions, by employing a binary mixture of large and small hard spheres, with a square-well attraction acting…