相关论文: Effective Localization number: building $k$-surviv…

We develop hard clustering based on likelihood rather than distance and prove convergence. We also provide simulations and real data examples.

We develop a network in which the natural numbers are the vertices. We use the decomposition of natural numbers by prime numbers to establish the connections. We perform data collapse and show that the degree distribution of these networks…

Determining the number of clusters present in a dataset is an important problem in cluster analysis. Conventional clustering techniques generally assume this parameter to be provided up front. %user supplied. %Recently, robustness of any…

There are various cluster validity indices used for evaluating clustering results. One of the main objectives of using these indices is to seek the optimal unknown number of clusters. Some indices work well for clusters with different…

Robust and accurate visual localization is a fundamental capability for numerous applications, such as autonomous driving, mobile robotics, or augmented reality. It remains, however, a challenging task, particularly for large-scale…

Hierarchical latent class (HLC) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are latent. There are no theoretically well justified model selection criteria for HLC models in particular and…

Capitalization is an important feature in many NLP tasks such as Named Entity Recognition (NER) or Part of Speech Tagging (POS). We are trying to reproduce results of paper which shows how to mitigate a significant performance drop when…

Certifiable local robustness, which rigorously precludes small-norm adversarial examples, has received significant attention as a means of addressing security concerns in deep learning. However, for some classification problems, local…

We study functional stochastic differential equations with a locally unbounded, functional drift focusing on well-posedness, stability and the strong Feller property. Following the non-functional case, we only consider integrability…

We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…

We describe several ordinal indices that are capable of detecting, according to various metric notions of faithfulness, the embeddability between pairs of Polish spaces. These embeddability ranks are of theoretical interest but seem…

Planet-scale photo geolocalization is the complex task of estimating the location depicted in an image solely based on its visual content. Due to the success of convolutional neural networks (CNNs), current approaches achieve super-human…

We introduce the notion of an E_k-ring with prelogarithmic structure, define logarithmic topological Hochschild homology and logarithmic topological cyclic homology in this context, and establish localization sequences for these theories.…

We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…

We present novel algorithmic techniques to efficiently verify the Kruskal rank of matrices that arise in sparse linear regression, tensor decomposition, and latent variable models. Our unified framework combines randomized hashing…

In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…

A class of high-order numerical algorithms for Riesz derivatives are established through constructing new generating functions. Such new high-order formulas can be regarded as the modification of the classical (or shifted) Lubich's…

We present a novel approach for relocalization or place recognition, a fundamental problem to be solved in many robotics, automation, and AR applications. Rather than relying on often unstable appearance information, we consider a situation…

In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…

L\'evy's Upward Theorem says that the conditional expectation of an integrable random variable converges with probability one to its true value with increasing information. In this paper, we use methods from effective probability theory to…