Related papers: A computer based classification of caps in PG(5,2)
This paper is a continuation of an earlier one, and completes a classification of the configurations of points in a plane lattice that determine angles that are rational multiples of ${\pi}$. We give a complete and explicit description of…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
Differential completions and compactifications of differential spaces are introduced and investigated. The existence of the maximal differential completion and the maximal differential compactification is proved. A sufficient condition for…
It is investigated how graded variants of integral and complete integral closures behave under coarsening functors and under formation of group algebras.
In this paper we classify all capable finite $p$-groups with derived subgroup of order $p$ and $G/G'$ of rank $n-1$.
Conformal prediction (CP) is a wrapper around traditional machine learning models, giving coverage guarantees under the sole assumption of exchangeability; in classification problems, for a chosen significance level $\varepsilon$, CP…
The algebraic method for computing the complete point symmetry group of a system of differential equations is extended to finding the complete equivalence group of a class of such systems. The extended method uses the knowledge of the…
We study search problems that can be solved by performing Gradient Descent on a bounded convex polytopal domain and show that this class is equal to the intersection of two well-known classes: PPAD and PLS. As our main underlying technical…
Reconstruction of evolutionary relationships between species is an important topic in the field of computational biology. Pairwise compatibility graphs (PCGs) are used to model such relationships. A graph is a PCG if its edges can be…
We investigate the computational complexity of mining guarded clauses from clausal datasets through the framework of inductive logic programming (ILP). We show that learning guarded clauses is NP-complete and thus one step below the…
The state-of-the-art approaches for image classification are based on neural networks. Mathematically, the task of classifying images is equivalent to finding the function that maps an image to the label it is associated with. To rigorously…
When creating the ranking based on the pairwise comparisons very often, we face difficulties in completing all the results of direct comparisons. In this case, the solution is to use the ranking method based on the incomplete PC matrix. The…
We give a classification and a construction of all smooth $(n-1)$-dimensional varieties of lines in ${\bf P}\sp n$ verifying that all their lines meet a curve. This also gives a complete classification of $(n-1)$-scrolls over a curve…
Shape completion, the problem of estimating the complete geometry of objects from partial observations, lies at the core of many vision and robotics applications. In this work, we propose Point Completion Network (PCN), a novel…
Computer vision based fine-grained recognition has received great attention in recent years. Existing works focus on discriminative part localization and feature learning. In this paper, to improve the performance of fine-grained…
Graph convolutional networks have been successful in addressing graph-based tasks such as semi-supervised node classification. Existing methods use a network structure defined by the user based on experimentation with fixed number of layers…
We construct an enlargement of the classifying space of mixed Hodge structures with polarized graded quotients, by adding mixed Hodge theoretic version of SL(2)-orbits. This space has a real analytic structure and a log structure with sign.…
A complete classifications, up to isomorphism, of two-dimensional associative and diassociative algebras over any basic field are given.
We present an image classification algorithm using deep learning convolutional neural network architecture, which classifies the morphologies of eclipsing binary systems based on their light curves. The algorithm trains the machine with…
We provide a complete classification of the possible cofinal structures of the families of precompact (totally bounded) sets in general metric spaces, and compact sets in general complete metric spaces. Using this classification, we…