Publications associées à NP-difficile

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.

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

Nisheeth Vishnoi, Javad Ebrahimi Boroojeni, Damian Mateusz Straszak

Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors v(1), ..., v(m) is an element of R-d and a constraint family B subset of 2([m]), find a set S. B that maximizes the squared volume of the sim ...

Ieee2017

On verifying causal consistency

Rachid Guerraoui, Jad Hamza

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of verifying automaticall ...

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Bernard Moret, Mingfu Shao

A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when ge ...

Mary Ann Liebert, Inc2016

In-Network View Synthesis for Interactive Multiview Video Systems

Pascal Frossard, Laura Toni

In multiview applications, camera views can be used as reference views to synthesize additional virtual viewpoints, allowing users to freely navigate within a 3D scene. However, bandwidth constraints may restrict the number of reference views sent to clien ...

Ieee-Inst Electrical Electronics Engineers Inc2016

A Comment on “Computational Complexity of Stochastic Programming Problems”

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

Springer Heidelberg2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Group-Sparse Model Selection: Hardness and Relaxations

Volkan Cevher, Anastasios Kyrillidis, Luca Baldassarre, Nirav Bhan

Group-based sparsity models are proven instrumental in linear regression problems for recovering signals from much fewer measurements than standard compressive sensing. The main promise of these models is the recovery of ``interpretable" signals along with ...

Institute of Electrical and Electronics Engineers2016

Influence of defect distribution on the reducibility of CeO2-x nanoparticles

Maria Chiara Spadaro

Ceria nanoparticles (NPs) are fundamental in heterogeneous catalysis because of their ability to store or release oxygen depending on the ambient conditions. Their oxygen storage capacity is strictly related to the exposed planes, crystallinity, density an ...

Iop Publishing Ltd2016

NP-difficile

Graph Chatbot

Chattez avec Graph Search

The weighted stable matching problem

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

On verifying causal consistency

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

In-Network View Synthesis for Interactive Multiview Video Systems

A Comment on “Computational Complexity of Stochastic Programming Problems”

Improved hardness results for unique shortest vector problem

Approximation algorithms for geometric dispersion

Group-Sparse Model Selection: Hardness and Relaxations

Influence of defect distribution on the reducibility of CeO2-x nanoparticles

On verifying causal consistency

The weighted stable matching problem

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Influence of defect distribution on the reducibility of CeO2-x nanoparticles

Approximation algorithms for geometric dispersion

Improved hardness results for unique shortest vector problem

Group-Sparse Model Selection: Hardness and Relaxations

In-Network View Synthesis for Interactive Multiview Video Systems

A Comment on “Computational Complexity of Stochastic Programming Problems”