Publications associées à NP (complexité)

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Stochastic gradient descent (SGD) and randomized coordinate descent (RCD) are two of the workhorses for training modern automated decision systems. Intriguingly, convergence properties of these methods are not well-established as we move away from the spec ...

EPFL2021

Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Jean-Philippe Léonard Bossuat, Christian Vincent Mouchet

We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE). To support our solution, we introduce a multiparty version of the Brakerski-Fa ...

2021

Amphiphilic nanoparticles generate curvature in lipid membranes and shape liposome-liposome interfaces

Francesco Stellacci, Francesca Olgiati

We show by molecular dynamics that amphiphilic Au nanoparticles (NP) with a diameter of 4 nm generate curvature in phosphatidylcholine lipid membranes. NPs generate negative curvature when they adsorb on the membrane surface but, as they get spontaneously ...

ROYAL SOC CHEMISTRY2021

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Mikhail Kapralov, Jakab Tardos, Navid Nouri, Aidasadat Mousavifar

In this paper, we resolve the complexity problem of spectral graph sparcification in dynamic streams up to polylogarithmic factors. Using a linear sketch we design a streaming algorithm that uses (O) over tilde (n) space, and with high probability, recover ...

ASSOC COMPUTING MACHINERY2020

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Ola Nils Anders Svensson, Moran Feldman, Rico Zenklusen, Ashkan Norouzi Fard

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multi-player model t ...

ASSOC COMPUTING MACHINERY2020

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Qi Yan, Li Jiang

This letter studies the measurement scheduling problem for a group of

N

mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life a ...

2020

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

Sparsity Invariance for Convex Design of Distributed Controllers

Maryam Kamgarpour, Luca Furieri, Yu Zheng

We address the problem of designing optimal linear time-invariant (LTI) sparse controllers for LTI systems, which corresponds to minimizing a norm of the closed-loop system subjected to sparsity constraints on the controller structure. This problem is NP-h ...

2020

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Ali Boujemaoui

Decreasing defects, waste time, meeting customer demand and being adaptable are the goals of a Zero Defect Manufacturing (ZDM) strategy. Scheduling is an important tool to perform that. It should take in account buffer size allocation. In this study, a met ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Catechol Containing Polyelectrolyte Complex Nanoparticles as Local Drug Delivery System for Bortezomib at Bone Substitute Materials

Martin Guillermo Mueller, Jeremy Pak Hei Wong

The proteasome inhibitor bortezomib (BZM) is one of the most potent anti-cancer drugs in the therapy of multiple myeloma. In this study, an adhesive drug delivery system (DDS) for BZM was developed. Therefore, we extended the present DDS concept of polyele ...

2020

NP (complexité)

Graph Chatbot

Chattez avec Graph Search

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Amphiphilic nanoparticles generate curvature in lipid membranes and shape liposome-liposome interfaces

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

New Results in Integer and Lattice Programming

Sparsity Invariance for Convex Design of Distributed Controllers

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Catechol Containing Polyelectrolyte Complex Nanoparticles as Local Drug Delivery System for Bortezomib at Bone Substitute Materials

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

New Results in Integer and Lattice Programming

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Amphiphilic nanoparticles generate curvature in lipid membranes and shape liposome-liposome interfaces

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Sparsity Invariance for Convex Design of Distributed Controllers

Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Catechol Containing Polyelectrolyte Complex Nanoparticles as Local Drug Delivery System for Bortezomib at Bone Substitute Materials

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing