Related papers: An algorithm for the arithmetic classification of …

We introduce an algorithm to generate (not solve) spin-glass instances with planted solutions of arbitrary size and structure. First, a set of small problem patches with open boundaries is solved either exactly or with a heuristic, and then…

Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…

A conjecture is given for the exact location of the multicritical point in the phase diagram of the +/- J Ising model on the triangular lattice. The result p_c=0.8358058 agrees well with a recent numerical estimate. From this value, it is…

In many high-impact applications, it is important to ensure the quality of output of a machine learning algorithm as well as its reliability in comparison with the complexity of the algorithm used. In this paper, we have initiated a…

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…

Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*)…

Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…

We restate a process presented by Stanley as a technique to prove that there exists exactly one $d$-differential distributive lattice for any positive integer $d$. This process can be trivially extended to apply to distributive finitary…

Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.

A straightforward algorithm for the symbolic computation of higher-order symmetries of nonlinear evolution equations and lattice equations is presented. The scaling properties of the evolution or lattice equations are used to determine the…

Algorithmic classifications of research publications can be used to study many different aspects of the science system, such as the organization of science into fields, the growth of fields, interdisciplinarity, and emerging topics. How to…

We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

This paper proposes a centroid-based clustering algorithm which is capable of clustering data-points with n-features, without having to specify the number of clusters to be formed. The core logic behind the algorithm is a similarity…

This work proposes a multi-image matching method to estimate semantic correspondences across multiple images. In contrast to the previous methods that optimize all pairwise correspondences, the proposed method identifies and matches only a…

We elaborate on a general method that we recently introduced for characterizing the "natural" structures in complex physical systems via a multiscale network based approach for the data mining of such structures. The approach is based on…

Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…

A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of…

Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…

In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…