Related papers: Kneser's method of neighbors
We present a Gibbs sampler for the Dempster-Shafer (DS) approach to statistical inference for Categorical distributions. The DS framework extends the Bayesian approach, allows in particular the use of partial prior information, and yields…
We study a family of integrable systems of nonlinearly coupled harmonic oscillators on the classical and quantum levels. We show that the integrability of these systems follows from their symmetry characterized by algebras called here…
Demands for minimum parameter setup in machine learning models are desirable to avoid time-consuming optimization processes. The $k$-Nearest Neighbors is one of the most effective and straightforward models employed in numerous problems.…
For an abelian category and a distinguished object with a graded endomorphism ring a necessary and sufficient criterion is given so that the category is equivalent to the abelian quotient of the category of finitely presented graded modules…
Kyurkchiev and Andreev (1985) constructed an infinite sequence of Weierstrass-type iterative methods for approximating all zeros of a polynomial simultaneously. The first member of this sequence of iterative methods is the famous method of…
It is classically known that the circle method produces an asymptotic for the number of representations of a tuple of integers $(n_1,\ldots,n_R)$ by a system of quadratic forms $Q_1,\ldots, Q_R$ in $k$ variables, as long as $k$ is…
E158 in the Enestrom index. Translation of the Latin original "Observationes analyticae variae de combinationibus" (1741). This paper introduces the problem of partitions, or partitio numerorum (the partition of integers). In the first part…
We compute an exact formula for the order of the class of the identity in the K_0 group of an infinite class of two-dimensional Kuntz-Crieger algebras.
This review describes the events leading up to the discovery of the Kerr metric in 1963 and the enormous impact the discovery has had in the subsequent 50 years. The review discusses the Penrose process, the four laws of black hole…
Back in 1755, Euler explored an interesting array of numbers that now frequently appears in polynomial identities, combinatorial problems, and finite calculus, among other places. These numbers share a strong connection with well-known…
The k-means algorithm is a partitional clustering method. Over 60 years old, it has been successfully used for a variety of problems. The popularity of k-means is in large part a consequence of its simplicity and efficiency. In this paper…
In the panoply of pattern classification techniques, few enjoy the intuitive appeal and simplicity of the nearest neighbor rule: given a set of samples in some metric domain space whose value under some function is known, we estimate the…
The k-nearest neighbors (k-NN) classification rule has proven extremely successful in countless many computer vision applications. For example, image categorization often relies on uniform voting among the nearest prototypes in the space of…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…
A novel type of approximants is introduced, being based on the ideas of self-similar approximation theory. The method is illustrated by the examples possessing the structure typical of many problems in applied mathematics. Good numerical…
We give a precise description of how the class group of a number field measures the failure of unique factorization in its ring of integers. Specifically, following ideas of Kummer, we determine the structure of all irreducible…
I describe a method of inferring the past of quantum observables given the initial state and the subsequent measurement results using Wigner quasi-probability representations. The method is proved to be compatible with logic for large…
We present a subdivision method to solve systems of congruence equations. This method is inspired in a subdivision method, based on Bernstein forms, to solve systems of polynomial inequalities in several variables and arbitrary degrees. The…
We introduce and explore a new method for inferring hidden geometric coordinates of nodes in complex networks based on the number of common neighbors between the nodes. We compare this approach to the HyperMap method, which is based only on…