Related papers: Effective Localization number: building $k$-surviv…
The structure of cones of positive and k-positive maps acting on a finite-dimensional Hilbert space is investigated. Special emphasis is given to their duality relations to the sets of superpositive and k-superpositive maps. We characterize…
We present another interpretation of the data by P.Markos and give a lot of new illustrations for our conception. All existing numerical data look perfectly compatible with predictions of the self-consistent theory of localization.
We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…
We reimplement the creature forcing construction used by Fischer et al. (arXiv:1402.0367) to separate Cicho\'{n}'s diagram into five cardinals as a countable support product. Using the fact that it is of countable support, we augment our…
The $k$-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to construct $k$-NN graphs remains a challenge, especially for…
Recent developments in decoding of Tanner codes with maximum-likelihood certificates are based on a sufficient condition called local-optimality. We define hierarchies of locally-optimal codewords with respect to two parameters. One…
The conformal compactification is considered in a hierarchy of hypercomplex projective spaces with relevance in physics including Minkowski and Anti-de Sitter space. The geometries are expressed in terms of bicomplex Vahlen matrices and…
We study multi-particle interactive quantum disordered systems on a polynomially-growing countable connected graph (Z,E). The novelty is to give localization bounds uniform in finite or infinite volumes (subgraphs) in Z^N as well as for the…
The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…
In this paper, a novel approach for coding nominal data is proposed. For the given nominal data, a rank in a form of complex number is assigned. The proposed method does not lose any information about the attribute and brings other…
We study algebras on which the Berenstein-Zelevinsky conjecture is true. In particular, we prove that this conjecture is true "up to localization".
This paper is about metric data structures in high-dimensional or non-Euclidean space that permit cached sufficient statistics accelerations of learning algorithms. It has recently been shown that for less than about 10 dimensions,…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
Place classification is a fundamental ability that a robot should possess to carry out effective human-robot interactions. It is a nontrivial classification problem which has attracted many research. In recent years, there is a high…
We consider local leaders in random uncorrelated networks, i.e. nodes whose degree is higher or equal than the degree of all of their neighbors. An analytical expression is found for the probability of a node of degree $k$ to be a local…
In this work, we Extend Pawlak approximation spaces by topological spaces. Also, Rough Membership, equality and inclusion relations are extended using topological near open sets. In addition, new extended measures of accuracy and quality of…
Place embeddings generated from human mobility trajectories have become a popular method to understand the functionality of places. Place embeddings with high spatial resolution are desirable for many applications, however, downscaling the…
Effective descent morphisms, originally defined in Grothendieck descent theory, form a class of special morphisms within a category. Essentially, an effective descent morphism enables bundles over its codomain to be fully described as…
As data volumes continue to grow, clustering and outlier detection algorithms are becoming increasingly time-consuming. Classical index structures for neighbor search are no longer sustainable due to the "curse of dimensionality". Instead,…
We present a general framework for derandomizing random linear codes with respect to a broad class of properties, known as local properties, which encompass several standard notions such as distance, list-decoding, list-recovery, and…