Related papers: Parametrizing the mixing matrix : A unified approa…
Matrix multiplication is a fundamental building block for large scale computations arising in various applications, including machine learning. There has been significant recent interest in using coding to speed up distributed matrix…
Unsupervised data representation and visualization using tools from topology is an active and growing field of Topological Data Analysis (TDA) and data science. Its most prominent line of work is based on the so-called Mapper graph, which…
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
Support for arithmetic in multiple precisions and number formats is becoming increasingly common in emerging high-performance architectures. From a computational scientist's perspective, our goal is to determine how and where we can safely…
We describe a seriation algorithm for ranking a set of items given pairwise comparisons between these items. Intuitively, the algorithm assigns similar rankings to items that compare similarly with all others. It does so by constructing a…
In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…
We propose a flexible and model independent parametrization of the neutrino mixing matrix, which takes advantage of the fact that there are up to three small quantities in neutrino mixing phenomenology: (i) the deviation from maximal mixing…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
The quest for regular models of arithmetic surfaces allows different viewpoints and approaches: using valuations or a covering by charts. In this article, we sketch both approaches and then show in a concrete example, how surprisingly…
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is permitted to be present in any of the input data. We…
This work developed novel complex matrix factorization methods for face recognition; the methods were complex matrix factorization (CMF), sparse complex matrix factorization (SpaCMF), and graph complex matrix factorization (GraCMF). After…
We examine how a parametrization of neutrino mixing matrix reflecting quark-lepton complementarity can be probed by considering phase-averaged oscillation probabilities, flavor composition of neutrino fluxes coming from atmospheric and…
In the past decade, matrix factorization has been extensively researched and has become one of the most popular techniques for personalized recommendations. Nevertheless, the dot product adopted in matrix factorization based recommender…
We consider clustering in group decision making where the opinions are given by pairwise comparison matrices. In particular, the k-medoids model is suggested to classify the matrices since it has a linear programming problem formulation…
Explicit analytical expression is derived for mixing matrix of three neutrinos in matter using a set of direct vacuum physical parameters. Results are presented in simple, symmetrical form. The physical contents are more clear than using of…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
The problem of finding overlapping communities in networks has gained much attention recently. Optimization-based approaches use non-negative matrix factorization (NMF) or variants, but the global optimum cannot be provably attained in…
Matching Logic is a framework for specifying programming language semantics and reasoning about programs. Its formulas are called patterns and are built with variables, symbols, connectives and quantifiers. A pattern is a combination of…
In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive…
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particularly useful in many applications, e.g., in text mining, image…