Related papers: Multiple-Description Lattice Vector Quantization
Accurate and well-calibrated Machine Learning (ML) models are mandatory in high-stakes settings, yet effective multiclass calibration remains challenging: global approaches assume calibration errors are homogeneous across the latent space,…
In this article, we develop and investigate a new classifier based on features extracted using spatial depth. Our construction is based on fitting a generalized additive model to the posterior probabilities of the different competing…
We translate notions and results of decomposition and dimension theories for module categories, into the lattice environment. In particular we translate dimension theory in module categories to complete modular upper-continuous lattices.
In this talk we highlight recent lattice calculations of the nucleon form factors and structure functions.
Valuation based systems verifying an idempotent property are studied. A partial order is defined between the valuations giving them a lattice structure. Then, two different strategies are introduced to represent valuations: as infimum of…
A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
We propose a construction of lattices from codes corresponding to lattices of type $A_n$, $D_n$ and $E_n$. This construction is a generalization of construction A of lattices from $p$-ary codes corresponding to a lattice of type $A_{p-1}$.…
These lectures discuss field theoretic techniques that might allow for realistic simulations of lattice QCD on small computers.
This paper presents the methodology for the system requirements and architecture w.r.t. their decomposition and refinement. It also introduces ideas of refinement layers and of refinement-based verification.
The use of topology for visualisation applications has become increasingly popular due to its ability to summarise data at a high level. Criticalities in scalar field data are used by visualisation methods such as the Reeb graph and contour…
We present an algorithm to enumerate isometry classes of integral quadratic lattices of a given rank and determinant, and analyze its running time by giving bounds on the number of genus symbols for a fixed rank and determinant. We build on…
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…
This article introduces and studies Minkowski Bisectors, Minkowski Cells, and Lattice Coverings.
The task of redescription mining explores ways to re-describe different subsets of entities contained in a dataset and to reveal non-trivial associations between different subsets of attributes, called views. This interesting and…
The multiple-biomarker classifier problem and its assessment are reviewed against the background of some fundamental principles from the field of statistical pattern recognition, machine learning, or the recently so-called "data science". A…
We propose a model for the quantum harmonic oscillator on a discrete lattice which can be written in supersymmetric form, in contrast with the more direct discretization of the harmonic oscillator. Its ground state is easily found to be…
The focus of this paper is on the analysis and design of Raptor codes using a multi-edge framework. In this regard, we first represent the Raptor code as a multi-edge type low-density parity-check (METLDPC) code. This MET representation…
We present vector-lattice-theoretic proofs of Riesz Representation Theorem and Stone Representation Theorem.
In this paper, we consider infinite-length versions of multiple zeta-star values. We give several explicit formulas for the infinite-length versions of multiple zeta-star values. We also discuss the analytic properties of the map from…