Related papers: Precise Algorithm to Generate Random Sequential Ad…
We develop a new efficient sequential approximate leverage score algorithm, SALSA, using methods from randomized numerical linear algebra (RandNLA) for large matrices. We demonstrate that, with high probability, the accuracy of SALSA's…
We develop an extension of subhalo abundance matching (SHAM) capable of accurately reproducing the real and redshift-space clustering of galaxies in a state-of-the-art hydrodynamical simulation. Our method uses a low-resolution gravity-only…
The Pandora's Box problem and its extensions capture optimization problems with stochastic input where the algorithm can obtain instantiations of input random variables at some cost. To our knowledge, all previous work on this class of…
Finding the densest sphere packing in $d$-dimensional Euclidean space $\mathbb{R}^d$ is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding…
Machine learning interatomic potentials (MLIPs) have revolutionized the modeling of materials and molecules by directly fitting to ab initio data. However, while these models excel at capturing local and semi-local interactions, they often…
In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers, where the aim is that of maximizing the throughput. Each node in the network has a local buffer of bounded size…
Kernel method has been developed as one of the standard approaches for nonlinear learning, which however, does not scale to large data set due to its quadratic complexity in the number of samples. A number of kernel approximation methods…
Existing methods for rotation estimation between two spherical ($\mathbb{S}^2$) patterns typically rely on spherical cross-correlation maximization between two spherical function. However, these approaches exhibit computational complexities…
We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hypercube. The goal is to find an axis-aligned non-overlapping…
We consider algorithms that, from an arbitrarily sampling of $N$ spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formulated as minimization problems with non-convex constraints.…
The SetCover problem has been extensively studied in many different models of computation, including parallel and distributed settings. From an approximation point of view, there are two standard guarantees: an $O(\log…
We present an algorithm to simulate random sequential adsorption (random "parking") of discs on constant-curvature surfaces: the plane, sphere, hyperboloid, and projective plane, all embedded in three-dimensional space. We simulate complete…
We consider two-species random sequential adsorption (RSA) in which species A and B adsorb randomly on a lattice with the restriction that opposite species cannot occupy nearest-neighbor sites. When the probability $x_A$ of choosing an A…
We investigate the problem of density estimation on the unit circle and the unit sphere from a computational perspective. Our primary goal is to develop new density estimators that are both rate-optimal and computationally efficient for…
For dealing with the equal sphere packing problem, we propose a serial symmetrical relocation algorithm, which is effective in terms of the quality of the numerical results. We have densely packed up to 200 equal spheres in spherical…
If a collection of identical particles is poured into a container, different shapes will fill to different densities. But what is the shape that fills a container as close as possible to a pre-specified, desired density? We demonstrate a…
Molecular simulations of the self-assembly of cone-shaped particles with specific, attractive interactions are performed. Upon cooling from random initial conditions, we find that the cones self assemble into clusters and that clusters…
In this paper, the binary random packing fraction of similar particles with size ratios ranging from unity to well over 2 is studied. The classic excluded volume model for spherocylinders and cylinders proposed by Onsager [1] is revisited…
Hard-particle packings have served as useful starting points to study the structure of diverse systems such as liquids, living cells, granular media, glasses, and amorphous solids. Howard Reiss has played a major role in helping to…
The densest binary sphere packings in the alpha-x plane of small to large sphere radius ratio alpha and small sphere relative concentration x have historically been very difficult to determine. Previous research had led to the prediction…