Related papers: O(N^2) fragmentation algorithm
We provide a deterministic algorithm that finds, in $\epsilon^{-O(1)} n^2$ time, an $\epsilon$-regular Frieze-Kannan partition of a graph on $n$ vertices. The algorithm outputs an approximation of a given graph as a weighted sum of…
Nuclear multifragmentation process can be viewed as a recombination of nucleons into clusters of various sizes. In a combinatorial analysis, various moments of cluster size distribution appear to be quite simple in terms of canonical…
We give an explicit algorithm and source code for computing optimal weights for combining a large number N of alphas. This algorithm does not cost O(N^3) or even O(N^2) operations but is much cheaper, in fact, the number of required…
The fragmentation of a two-dimensional circular disc by lateral impact is investigated using a cell model of brittle solid. The disc is composed of numerous unbreakable randomly shaped convex polygons connected together by simple elastic…
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\varepsilon^{5/3})$ time randomized FPTAS for Partition, which is…
Hashing method maps similar data to binary hashcodes with smaller hamming distance, and it has received a broad attention due to its low storage cost and fast retrieval speed. However, the existing limitations make the present algorithms…
The fission-fragments mass-yield of 236U is obtained by an approximate solution of the eigenvalue problem of the collective Hamiltonian that describes the dynamics of the fission process whose degrees of freedom are: the fission…
We introduce the strongly NP-complete pagination problem, an extension of BIN PACKING where packing together two items may make them occupy less volume than the sum of their individual sizes. To achieve this property, an item is defined as…
We report on our study of asteroidal breakups, i.e. fragmentations of targets, subsequent gravitational reaccumulation and formation of small asteroid families. We focused on parent bodies with diameters $D_{\rm pb} = 10$ km. Simulations…
We provide an algorithm for properly learning mixtures of two single-dimensional Gaussians without any separability assumptions. Given $\tilde{O}(1/\varepsilon^2)$ samples from an unknown mixture, our algorithm outputs a mixture that is…
The experiment consists of counting and measuring the size of the many fragments observed after the fall of a mercury drop on the floor. The size distribution follows a power-law for large enough fragments. We address the question of a…
A modified dynamic programming algorithm rapidly and accurately solves large 0/1 knapsack problems. It has computational O(nlogn), space O(nlogn) and predictable maximum error. Experimentally it's accuracy increases faster than linearly…
In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step which by default has a $\mathcal O(N^2)$ complexity (where $N$ is the number of particles). Existing improvements in the literature…
We have developed a simulation technique that uses non-linear finite element analysis and elastic fracture mechanics to compute physically plausible motion for three-dimensional, solid objects as they break, crack, or tear. When these…
We study gravitational clustering of mass points in three dimensions with random initial positions and periodic boundary conditions (no expansion) by numerical simulations. Correlation properties are well defined in the system and a sort of…
We introduce a numerical method to integrate tidal effects on collisional systems, using any definition of the external potential as a function of space and time. Rather than using a linearisation of the tidal field, this new method follows…
The recently introduced nested sampling algorithm allows the direct and efficient calculation of the partition function of atomistic systems. We demonstrate its applicability to condensed phase systems with periodic boundary conditions by…
This work examines strategies to handle large shared data objects in distributed storage systems (DSS), while boosting the number of concurrent accesses, maintaining strong consistency guarantees, and ensuring good operation performance. To…
We study the discrete bin covering problem where a multiset of items from a fixed set $S \subseteq (0,1]$ must be split into disjoint subsets while maximizing the number of subsets whose contents sum to at least $1$. We study the online…
We propose a collision-oriented particle system to approximate a class of Landau-type equations. This particle system is formally derived from a particle system with random collisions in the grazing regime, and happens to be a special…