Deterministic Online Bipartite Edge Coloring

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.

In this work, we study online submodular maximization and how the requirement of maintaining a stable solution impacts the approximation. In particular, we seek bounds on the best-possible approximation ratio that is attainable when the algorithm is allowe ...

A CUR approximation of a matrix A is a particular type of low-rank approximation A approximate to CUR, where C and R consist of columns and rows of A, respectively. One way to obtain such an approximation is to apply column subset selection to A and A(T). ...

Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being ...

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream wi ...

In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...

We analyze a generalization of a recent algorithm of Bleichenbacher et al.~for decoding interleaved codes on the

Q

-ary symmetric channel for large

Q

. We will show that for any

m

and any

\epsilon

the new algorithms can decode up to a fraction of at ...

Deterministic Online Bipartite Edge Coloring

Chattez avec Graph Search

The Cost of Consistency: Submodular Maximization with Constant Recourse

Low-Rank Approximation In The Frobenius Norm By Column And Row Subset Selection

Indiscreet logarithms in finite fields of small characteristic

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

An Efficient Streaming Algorithm for the Submodular Cover Problem

On the facet-to-facet property of solutions to convex parametric quadratic programs

Improved Decoding of Interleaved AG-Codes