Related papers: A Division Algorithm for the Gaussian Integers' Mi…
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…
Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition…
In this paper we study singular integrals on small (that is, measure zero and lower than full dimensional) subsets of metric groups. The main examples of the groups we have in mind are Euclidean spaces and Heisenberg groups. In addition to…
The distant graph $G = G(\mathbb{P}(Z),\triangle)$ of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein's geometric interpretation of Euclidean continued…
We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…
Let $k\ge 1,a\ge 1,b\ge 0$ and $ c\ge 1$ be integers. Let $f$ be a multiplicative function with $f(n)\ne 0$ for all positive integers $n$. We define the arithmetic function $g_{k,f}$ for any positive integer $n$ by…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
Consider a family of distributions $\{\pi_{\beta}\}$ where $X\sim\pi_{\beta}$ means that $\mathbb{P}(X=x)=\exp(-\beta H(x))/Z(\beta)$. Here $Z(\beta)$ is the proper normalizing constant, equal to $\sum_x\exp(-\beta H(x))$. Then…
Low rank matrix approximation is a popular topic in machine learning. In this paper, we propose a new algorithm for this topic by minimizing the least-squares estimation over the Riemannian manifold of fixed-rank matrices. The algorithm is…
A reproducing kernel can define an embedding of a data point into an infinite dimensional reproducing kernel Hilbert space (RKHS). The norm in this space describes a distance, which we call the kernel distance. The random Fourier features…
Recently, there has been some interest in values of arithmetical functions on members of special sequences, such as Euler's totient function $\phi$ on factorials, linear recurrences, etc. In this article, we investigate, for given positive…
Probability functions figure prominently in optimization problems of engineering. They may be nonsmooth even if all input data are smooth.This fact motivates the consideration of subdifferentials for such typically just continuous…
The division operation is important for many areas of data processing. Especially considering today's demand for hardware accelerators for machine learning algorithms, there is a high demand for an efficient calculation of the division…
In probability theory, the partition function is a factor used to reduce any probability function to a density function with total probability of one. Among other statistical models used to represent joint distribution, Markov random fields…
The Euclidean minimum $M(K)$ of a number field $K$ is an important numerical invariant that indicates whether $K$ is norm-Euclidean. When $K$ is a non-CM field of unit rank 2 or higher, Cerri showed $M(K)$, as the supremum in the Euclidean…
We introduce a non-linear criterion which allows us to determine when a function can be written as a sum of functions belonging to homogeneous fractional spaces: for $\ell \in \mathbb{N}^*$, $s_i\in (0, 1)$ and $p_i \in [1, +\infty)$, $u :…
In this note we present techniques to compute inhomogeneous minima of norm forms; as an application, we determine all norm-Euclidean complex bicyclic quartic number fields.
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
In this paper, we construct an algorithm for minimising piecewise smooth functions for which derivative information is not available. The algorithm constructs a pair of quadratic functions, one on each side of the point with smallest known…