Related papers: Fiedler-Ptak scaling in max algebra

Machine learning components commonly appear in larger decision-making pipelines; however, the model training process typically focuses only on a loss that measures accuracy between predicted values and ground truth values. Decision-focused…

This is an English (annotated) translation of the German paper by Max Planck (1916) "On the absolute entropy of monatomic bodies" (\"Uber die absolute Entropie einatomiger K\"orper).

Topological transforms have been very useful in statistical analysis of shapes or surfaces without restrictions that the shapes are diffeomorphic and requiring the estimation of correspondence maps. In this paper we introduce two…

Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We study a notion of MDS on infinite metric measure spaces,…

These lecture notes are based on an introductory course given by the author at the summer school "Noncommutative Algebraic Geometry" at MSRI in June 2012. The emphasis throughout is on examples to illustrate the many different facets of…

In the context of general iterated function systems (IFSs), we introduce bilinear fractal interpolants as the fixed points of certain Read-Bajraktarevi\'{c} operators. By exhibiting a generalized "taxi-cab" metric, we show that the graph of…

Dimensionality reduction and clustering techniques are frequently used to analyze complex data sets, but their results are often not easy to interpret. We consider how to support users in interpreting apparent cluster structure on scatter…

While there are numerous linear algebra teaching tools, they tend to be focused on the basics, and not handle the more advanced aspects. This project aims to fill that gap, focusing specifically on methods like Strassen's fast matrix…

We study systems of quadratic forms over fields and their isotropy over 2-extensions. We apply this to obtain particular splitting fields for quaternion algebras defined over a finite field extension. As a consequence, we obtain that every…

These are notes of lectures on spinning particles and the worldline formalism originally given by Olindo Corradini and Christian Schubert at the School on Spinning Particles in Quantum Field Theory: Worldline Formalism, Higher Spins, and…

Graph Partitioning is a critical problem in numerous scientific and engineering domains including social network analysis, VLSI design, and many more. Spectral methods are known to produce quality partitions while minimizing edge cuts for a…

We correct some unfortunate mistakes that appeared in the article D. Taghizadeh, M. Zahraei, A. Peperko and N. H. Aboutalebi, On the numerical ranges of matrices in max algebra, Banach j. Math. Anal., 14 (2020), pp. 1773-1792 concerning…

We briefly recount the long friendship that developed between Ludwig and us (Moshe Flato and I), since we first met at ICM 1966 in Moscow. That friendship extended to his school and family, and persists to this day. Its strong personal…

Here we give further evidences to support our scaling relation described in our previous paper [cond-mat/0006459, Phys. Rev. Lett. Vol.85, pp.1238 (2000)].

This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…

This volume contains the papers accepted at the First International Workshop on FPGAs for Software Programmers (FSP 2014), held in Munich, Germany, September 1st, 2014. FSP 2014 was co-located with the International Conference on Field…

We propose a distributed first-order augmented Lagrangian (DFAL) algorithm to minimize the sum of composite convex functions, where each term in the sum is a private cost function belonging to a node, and only nodes connected by an edge can…

We introduce a method called multi-scale local shape analysis, or MLSA, for extracting features that describe the local structure of points within a dataset. The method uses both geometric and topological features at multiple levels of…

The 11th workshop, Descriptional Complexity of Formal Systems 2009, is taking place in Magdeburg, Germany, on July 6-9, 2009. It is jointly organized by the IFIP Working Group 1.2 on Descriptional Complexity and by the Faculty of Computer…

We present a new family of min-max optimization algorithms that automatically exploit the geometry of the gradient data observed at earlier iterations to perform more informative extra-gradient steps in later ones. Thanks to this adaptation…