Publications associées à Detecting the Origin of Text Segments Efficiently

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.

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Detecting the Origin of Text Segments Efficiently

Graph Chatbot

Chattez avec Graph Search

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Results on Sparse Integer Programming and Geometric Independent Sets

On Polynomial Algorithms for Normalizing Formulas

Model order reduction of flow based on a modular geometrical approximation of blood vessels

Toward a remote assessment of walking bout and speed: application in patients with multiple sclerosis

Symbolic Algorithms for Token Swapping

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

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

Linearly Convergent Frank-Wolfe with Backtracking Line-Search

New Results in Integer and Lattice Programming

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

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

Actuator Placement under Structural Controllability using Forward and Reverse Greedy Algorithms

New Results in Integer and Lattice Programming

Results on Sparse Integer Programming and Geometric Independent Sets

Model order reduction of flow based on a modular geometrical approximation of blood vessels

On Polynomial Algorithms for Normalizing Formulas

Symbolic Algorithms for Token Swapping

Toward a remote assessment of walking bout and speed: application in patients with multiple sclerosis

Linearly Convergent Frank-Wolfe with Backtracking Line-Search