Concept

Espace vectoriel ordonné

Publications associées (27)

The ABCD of topological recursion

Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of [43], seeing it as a quantisation of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial da ...

Academic Press Inc Elsevier Science2024

Mean value theorems for collections of lattices with a prescribed group of symmetries

Nihar Prakash Gargava

Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...

EPFL2024

Persistence and the Sheaf-Function Correspondence

Nicolas Michel Berkouk

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently in ...

Cambridge Univ Press2023

Efficient and Effective Multi-Modal Queries Through Heterogeneous Network Embedding

Karl Aberer, Quoc Viet Hung Nguyen, Thanh Trung Huynh, Thành Tâm Nguyên, Chi Thang Duong

The heterogeneity of today's Web sources requires information retrieval (IR) systems to handle multi-modal queries. Such queries define a user's information needs by different data modalities, such as keywords, hashtags, user profiles, and other media. Rec ...

IEEE COMPUTER SOC2022

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

EPFL2022

Idempotents in the endomorphism algebra of a finite lattice

Jacques Thévenaz, Serge Bouc

We give a direct construction of a specific central idempotent in the endomorphism algebra of a finite lattice T. This idempotent is associated with all possible sublattices of T which are totally ordered. A generalization is considered in a conjectural fa ...

2022

Packing the Boolean lattice with copies of a poset

Istvan Tomon

The Boolean lattice (2[n],subset of) is the family of all subsets of [n]={1,MIDLINE HORIZONTAL ELLIPSIS,n}, ordered by inclusion. Let P be a partially ordered set. We prove that if n is sufficiently large, then there exists a packing P of copies of P in (2 ...

WILEY2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Decompositions of dependence for high-dimensional extremes

Emeric Rolland Georges Thibaud

We propose two decompositions that help to summarize and describe high-dimensional tail dependence within the framework of regular variation. We use a transformation to define a vector space on the positive orthant and show that transformed-linear operatio ...

OXFORD UNIV PRESS2019

Forbidden induced subposets of given height

Istvan Tomon

Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

Almost tiling of the Boolean lattice with copies of a poset

Istvan Tomon

Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...

ELECTRONIC JOURNAL OF COMBINATORICS2018

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Shape Projectors for Landmark-Based Spline Curves

Michaël Unser, Daniel Andreas Schmitter

We present a generic method to construct orthogonal projectors for two-dimensional landmark-based parametric spline curves. We construct vector spaces that define a geometric transformation (e.g., affine, similarity, and scaling) that is applied to a refer ...

IEEE Institute of Electrical and Electronics Engineers2017

Spline Shape Processing : Representation, Learning, and Modeling

Daniel Andreas Schmitter

In this thesis, we present a novel generic and unifying framework for data-adaptive shape modeling. Our work is motivated by the raising need for powerful geometric modeling kernels that are required for shape characterization in biomedical imaging. The on ...

EPFL2017

Multiple-field based code generator and decoder for communications systems

Mohammad Amin Shokrollahi, Lorenz Minder

A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols base ...

2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Mumford-Shah and Potts Regularization for Manifold-Valued Data

Martin Kurt Storath

Mumford-Shah and Potts functionals are powerful variational models for regularization which are widely used in signal and image processing; typical applications are edge-preserving denoising and segmentation. Being both non-smooth and non-convex, they are ...

Springer2016

Cross-lingual Linking of Multi-word Entities and their corresponding Acronyms

Maud Ehrmann

This paper reports on an approach and experiments to automatically build a cross-lingual multi-word entity resource. Starting from a collection of millions of acronym/expansion pairs for 22 languages where expansion variants were grouped into monolingual c ...

European Language Resources Association (ELRA)2016

MECHANICAL SPECTROSCOPY OF ORDERED BINARY Au-Cu

Daniele Mari, Robert Schaller, Iva Tkalcec Vâju

We have studied a binary Au-Cu single crystal by mechanical spectroscopy. Upon very slow cooling from high temperatures, additional relaxation peaks arise at lower frequencies in isothermal spectra after the disappearing of the Zener peak below 665 K due t ...

Polska Akad Nauk, Polish Acad Sciences, Inst Metall & Mater Sci Pas2015

Method to determine the distribution of temperature sensors

Martin Vetterli, David Atienza Alonso, Juri Ranieri, Amina Chebira, Alessandro Vincenzi

Apparatus comprising M sensors for measuring the temperature on M locations of the apparatus and an estimator configured to estimate a temperature vector of the apparatus with N temperature variables, whereby the estimator is configured to approximate the ...

2014