Related papers: A computer based classification of caps in PG(5,2)
An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.
Point cloud completion is a vital task focused on reconstructing complete point clouds and addressing the incompleteness caused by occlusion and limited sensor resolution. Traditional methods relying on fixed local region partitioning, such…
We provide a complete classification of the singularities of cluster algebras of finite cluster type. This extends our previous work about the case of trivial coefficients. Additionally, we classify the singularities of cluster algebras for…
Most state-of-the-art techniques for multi-class image segmentation and labeling use conditional random fields defined over pixels or image regions. While region-level models often feature dense pairwise connectivity, pixel-level models are…
In this paper we present a complete classification (isomorphism classes with some isomorphism invariants) of complex associative algebras up to dimension five (including both cases: unitary and non-unitary). In some symbolic computations we…
We construct and study a graded version of absolute perfectoidization for $G$-graded adic rings. As a main geometric application, we show that the absolute perfectoidization of the structure sheaf of a projective-type formal scheme admits…
We introduce an end-to-end learnable technique to robustly identify feature edges in 3D point cloud data. We represent these edges as a collection of parametric curves (i.e.,lines, circles, and B-splines). Accordingly, our deep neural…
Conformal Prediction (CP) is a powerful framework for constructing prediction sets with guaranteed coverage. However, recent studies have shown that integrating confidence calibration with CP can lead to a degradation in efficiency. In this…
2834 inequivalent spreads under the group $\mathrm{P}\Gamma\mathrm{L}(4,8)$. Therefore there are the same number of translation planes of order 64 with kernel containing $\mathrm{GF}(8)$, and we describe various properties of these planes.…
Multiview point cloud registration serves as a cornerstone of various computer vision tasks. Previous approaches typically adhere to a global paradigm, where a pose graph is initially constructed followed by motion synchronization to…
We complete the description of group gradings on finite-dimensional incidence algebras. Moreover, we classify the finite-dimensional graded algebras that can be realized as incidence algebras endowed with a group grading.
Mining for trees in a graph is shown to be NP-complete.
An unsupervised point cloud object retrieval and pose estimation method, called PCRP, is proposed in this work. It is assumed that there exists a gallery point cloud set that contains point cloud objects with given pose orientation…
In this work we present a system for the automatic classification of the light curves of eclipsing binaries. This system is based on a classification scheme that aims to separate eclipsing binary sistems according to their geometrical…
We describe and implement an algorithm to find all post-critically finite (PCF) cubic polynomials defined over $\mathbb{Q}$, up to conjugacy over $\text{PGL}_2(\bar{\mathbb{Q}})$. We describe normal forms that classify equivalence classes…
We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.
The method of preliminary group classification is rigorously defined, enhanced and related to the theory of group classification of differential equations. Typical weaknesses in papers on this method are discussed and strategies to overcome…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…