English
Related papers

Related papers: Multiplied configurations characterized by their c…

200 papers

We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…

Logic in Computer Science · Computer Science 2019-04-25 Walid Belkhir , Nicolas Ratier , Duy Duc Nguyen Michel Lenczner

We study the problem of multi-class classification under system-level constraints expressible as linear functionals over randomized classifiers. We propose a post-processing approach that adjusts a given base classifier to satisfy general…

Optimization and Control · Mathematics 2025-12-17 Evgenii Chzhen , Mohamed Hebiri , Gayane Taturyan

A monoid structure on families of representations of a quiver is introduced by taking extensions of representations in families, i.e. subvarieties of the varieties of representations. The study of this monoid leads to interesting…

Rings and Algebras · Mathematics 2007-05-23 Markus Reineke

We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…

Rings and Algebras · Mathematics 2024-02-07 A. Amparan , I. Baragaña , S. Marcaida , A. Roca

In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…

Logic in Computer Science · Computer Science 2023-07-11 Haruka Tomita

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

Logic · Mathematics 2017-01-04 Sergey V. Sudoplatov

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Rings and Algebras · Mathematics 2011-02-23 Tamás Waldhauser

We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…

Logic in Computer Science · Computer Science 2023-07-20 Peter Hanukaev , Harley Eades

Traditional approaches to Bayes net structure learning typically assume little regularity in graph structure other than sparseness. However, in many cases, we expect more systematicity: variables in real-world systems often group into…

Machine Learning · Computer Science 2012-07-02 Vikash Mansinghka , Charles Kemp , Thomas Griffiths , Joshua Tenenbaum

Contract theories have been proposed to formally support distributed and decentralized system design while ensuring safe system integration. In this paper we propose hypercontracts, a generic model with a richer structure for its underlying…

Logic in Computer Science · Computer Science 2022-06-14 Inigo Incer , Albert Benveniste , Alberto Sangiovanni-Vincentelli , Sanjit A. Seshia

For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.

We here show that the family of finite-dimensional, discrete-time, passive, linear time-invariant systems can be characterized through the structure of maximal, matrix-convex set, closed under multiplication among its elements. Moreover,…

Optimization and Control · Mathematics 2021-02-03 Izchak Lewkowicz

A method of constructing a class of bihamiltonian structures is presented. Elements of this class are generalizations of the so-called bihamiltonian structures of general position on odd-dimensional manifolds. The method consists in a…

Differential Geometry · Mathematics 2007-05-23 Andriy Panasyuk

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

Data Structures and Algorithms · Computer Science 2010-10-07 Ferdinando Cicalese , Ugo Vaccaro

A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…

Rings and Algebras · Mathematics 2012-04-12 Lars Hellström

The paper proposes a novel technique for representing templates and instances of concept classes. A template representation refers to the generic representation that captures the characteristics of an entire class. The proposed technique…

Machine Learning · Computer Science 2020-07-08 Graham Spinks , Marie-Francine Moens

Estimating dependence relationships between variables is a crucial issue in many applied domains, such as medicine, social sciences and psychology. When several variables are entertained, these can be organized into a network which encodes…

Methodology · Statistics 2025-01-01 Federico Castelletti

This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…

Combinatorics · Mathematics 2024-01-09 Arnauld Mesinga Mwafise

On the transversals of a subgroup of a group, using the binary operation of the group, structural mappings are defined. Based on these mappings, the notion of the hypergroup over the group is introduced, which generalizes the notion of the…

Group Theory · Mathematics 2015-08-11 Samuel H. Dalalyan

We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…

Logic in Computer Science · Computer Science 2023-06-22 Daniel Gratzer , G. A. Kavvos , Andreas Nuyts , Lars Birkedal
‹ Prev 1 8 9 10 Next ›