Publications associées à Cluster-and-Conquer: When Randomness Meets Graph Locality

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

Cluster-and-Conquer: When Randomness Meets Graph Locality

Graph Chatbot

Chattez avec Graph Search

Actuator Placement for Optimizing Network Performance under Controllability Constraints

New Graph Algorithms via Polyhedral Techniques

Fingerprinting Big Data: The Case of KNN Graph Construction

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Alignment and Assembly

Network Alignment: Theory, Algorithms, and Applications

Sparse Group Covers and Greedy Tree Approximations

Projection onto the Manifold of Elongated Structures for Accurate Extraction

Right-Protected Data Publishing with Provable Distance-Based Mining

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Actuator Placement for Optimizing Network Performance under Controllability Constraints

Network Alignment: Theory, Algorithms, and Applications

Fingerprinting Big Data: The Case of KNN Graph Construction

New Graph Algorithms via Polyhedral Techniques

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Alignment and Assembly

Sparse Group Covers and Greedy Tree Approximations

Projection onto the Manifold of Elongated Structures for Accurate Extraction

Right-Protected Data Publishing with Provable Distance-Based Mining

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods