Publications associées à Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

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.

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

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

Graph Chatbot

Chattez avec Graph Search

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

A Reinforcement Learning Approach to Train Routing and Scheduling

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

The (h, k)-Server Problem on Bounded Depth Trees

Freight railway network design problem

Distinct distances between points and lines

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

LPN in Cryptography

The (h, k)-Server Problem on Bounded Depth Trees

Distinct distances between points and lines

LPN in Cryptography

A Reinforcement Learning Approach to Train Routing and Scheduling

Freight railway network design problem

On Computing Breakpoint Distances for Genomes with Duplicate Genes

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Robust Adaptive Decision Making: Bayesian Optimization and Beyond