Related papers: Constructing the covariant three-point vertices sy…

We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…

We present a new algorithm to rapidly compute the two-point (2PCF), three-point (3PCF) and n-point (n-PCF) correlation functions in roughly O(N log N) time for N particles, instead of O(N^n) as required by brute force approaches. The…

I present a covariant approach to developing 1+3 formalism without an introduction of any basis or coordinates. In the formalism, a spacetime which has a timelike congruence is assumed. Then, tensors are split into temporal and spatial…

We present a new efficient algortithm for construction of linear latent structure (LLS) models. This algorithm reduces a problem of estimation of model parameters to a sequence of problems of linear algebra, which assures a low…

We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space. The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori…

An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…

We present a particle locating method for unstructured meshes in two and three dimensions. Our algorithm is based on a patch searching process, and includes two steps. We first locate the given point to a patch near a vertex, and then the…

We examine methods that have been proposed for determining the helicity structure of decays of new resonances to third generation quarks and/or leptons. We present analytical and semi-analytical predictions and assess the applicability of…

Reconstructing a composition (union) of convex polytopes that perfectly fits the corresponding input point-cloud is a hard optimization problem with interesting applications in reverse engineering and rigid body dynamics simulations. We…

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…

Using the multisymplectic Hamiltonian formalism, we propose a Poisson bracket for the electromagnetic field that, in addition to satisfying the restricted principle of relativity, reproduces well-established results from the standard…

We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses $\mathcal{O}(\log n)$ applications of the matrix on…

Division algorithms have been developed to reduce latency and to improve the efficiency of the processors. Floating point division is considered as a high latency operation. This papers looks into one such division algorithm, examines the…

This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group…

Using non-relativistic effective field theory, we derive a three-particle analog of the Lellouch-L\"uscher formula at the leading order. This formula relates the three-particle decay amplitudes in a finite volume with their infinite-volume…

We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a desired goal. We use the geometric amoebot model as our…

We present an amelioration of current known algorithms for optimal spectral partitioning problems. The idea is to use the advantage of a representation using density functions while decreasing the computational time. This is done by…

We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…

The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres…

The issue of computing (co)homology generators of a cell complex is gaining a pivotal role in various branches of science. While this issue can be rigorously solved in polynomial time, it is still overly demanding for large scale problems.…