Related papers: A computer based classification of caps in PG(4,2)
Computational morphology handles the language processing at the word level. It is one of the foundational tasks in the NLP pipeline for the development of higher level NLP applications. It mainly deals with the processing of words and word…
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…
In this theoretical note we compare different types of computational models of word similarity and association in their ability to predict a set of about 900 rating data. Using regression and predictive modeling tools (neural net, decision…
We give a complete derived equivalence classification of all nonstandard representation-infinite domestic selfinjective algebras over an algebraically closed field. As a consequence, also a complete stable equivalence classification of…
Image classification is an essential task in computer vision, which aims to categorise a set of images into different groups based on some visual criteria. Existing methods, such as convolutional neural networks, have been successfully…
This paper proposes probabilistic conformal prediction (PCP), a predictive inference algorithm that estimates a target variable by a discontinuous predictive set. Given inputs, PCP construct the predictive set based on random samples from…
The aim of this paper is to carry out an explicit construction of CAP representations of GL(2) over a division quaternion algebra with discriminant two. We first construct cusp forms on such group explicitly by lifting from Maass cusp forms…
Terrestrial laser scanning (TLS) can obtain tree point cloud with high precision and high density. Efficient classification of wood points and leaf points is essential to study tree structural parameters and ecological characteristics. By…
We draw two incomplete, biased maps of challenges in computational complexity lower bounds.
We show how, given a sufficiently large point cloud sampled from an embedded 2-manifold in $\mathbb{R}^n$, we may obtain a global representation as a cell complex with vertices given by a representative subset of the point cloud. The vertex…
We define graded group schemes and graded group varieties and develop their theory. Graded group schemes are the graded analogue of group schemes and are in correspondence with graded Hopf algebra. In this setting, graded group varieties…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
In the problems of image retrieval and annotation, complete textual tag lists of images play critical roles. However, in real-world applications, the image tags are usually incomplete, thus it is important to learn the complete tags for…
We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.
We present a complete classification of complex plane algebraic curves, equipped with the induced Euclidean, up to global bilipschitz homeomorphism.
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
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.
We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…
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…
We study convergence of the iterative projected gradient (IPG) algorithm for arbitrary (possibly nonconvex) sets and when both the gradient and projection oracles are computed approximately. We consider different notions of approximation of…