Publications associées à A Unified Framework for Max-Min and Min-Max Fairness with Applications

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Graph Chatbot

Chattez avec Graph Search

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

Realizability of planar point embeddings from angle measurements

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Conditional gradient methods for stochastically constrained convex minimization

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Learning Generalized Nash Equilibria in a Class of Convex Games

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

The Impact of RDMA on Agreement

Memory Efficient Max Flow for Multi-Label Submodular MRFs

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

The Impact of RDMA on Agreement

Learning Generalized Nash Equilibria in a Class of Convex Games

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Conditional gradient methods for stochastically constrained convex minimization

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Realizability of planar point embeddings from angle measurements

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Memory Efficient Max Flow for Multi-Label Submodular MRFs