Concept

Prim's algorithm

Related publications (616)

Learning Generalized Nash Equilibria in a Class of Convex Games

We consider multiagent decision making where each agent optimizes its convex cost function subject to individual and coupling constraints. The constraint sets are compact convex subsets of a Euclidean space. To learn Nash equilibria, we propose a novel dis ...

2019

Communication trade-offs for Local-SGD with large step size

Aymeric Daphnis Kévin Dieuleveut

Synchronous mini-batch SGD is state-of-the-art for large-scale distributed machine learning. However, in practice, its convergence is bottlenecked by slow communication rounds between worker nodes. A natural solution to reduce communication is to use the " ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

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

Marek Elias

We study the k-server problem in the resource augmentation setting, i.e., when the performance of the online algorithm with k servers is compared to the offline optimal solution with h

ASSOC COMPUTING MACHINERY2019

Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees

Nisheeth Vishnoi, Laura Elisa Celis, Vijay Keswani, Lingxiao Huang

Developing classification algorithms that are fair with respect to sensitive attributes of the data is an important problem due to the increased deployment of classification algorithms in societal contexts. Several recent works have focused on studying cla ...

ASSOC COMPUTING MACHINERY2019

A disaggregate choice-based approach to find epsilon-equilibria of oligopolistic markets

Michel Bierlaire, Virginie Janine Camille Lurkin, Stefano Bortolomiol

We present a general framework to find epsilon-equilibrium solutions of oligopolistic markets in which demand is modeled at the disaggregate level using discrete choice models. Consumer choices are modeled according to random utility theory, and the choice ...

2019

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Rüdiger Urbanke, Kirill Ivanov

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...

IEEE2019

Reversible Pebbling Game for Quantum Memory Management

Giovanni De Micheli, Mathias Soeken, Giulia Meuli

Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extr ...

IEEE2019

Two-step phase shifting interferometry based on orientation selective monogenic filtering

Pramod Rastogi, Rishikesh Dilip Kulkarni

We propose a phase step estimation algorithm in a two-step phase shifting interferometry setup based on orientation selective adaptive monogenic filtering (AMF). Initially, the AMF algorithm is used for the fringe pattern normalization. A minor modificatio ...

2019

Performance of missing transverse momentum reconstruction in proton-proton collisions at $\sqrt{s} =$ 13 TeV using the CMS detector

Jian Wang, Matthias Finger, Lesya Shchutska, Qian Wang, Matthias Wolf, Varun Sharma, Konstantin Androsov, Jan Steggemann, Leonardo Cristella, Xin Chen, Davide Di Croce, Mingkui Wang, João Miguel das Neves Duarte, Tagir Aushev, Tian Cheng, Yixing Chen, Werner Lustermann, Andromachi Tsirou, Alexis Kalogeropoulos, Andrea Rizzi, Ioannis Papadopoulos, Paolo Ronchese, Thomas Muller, Ho Ling Li, Giuseppe Codispoti, Hua Zhang, Siyuan Wang, Peter Hansen, Daniel Gonzalez, Tao Huang, David Vannerom, Michele Bianco, Kun Shi, Wei Shi, Abhisek Datta, Ji Hyun Kim, Donghyun Kim, Dipanwita Dutta, Zheng Wang, Sanjeev Kumar, Wei Li, Yong Yang, Yi Wang, Ajay Kumar, Ashish Sharma, Georgios Anagnostou, Joao Varela, Csaba Hajdu, Muhammad Ahmad, Ekaterina Kuznetsova, Ioannis Evangelou, Matthias Weber, Muhammad Shoaib, Milos Dordevic, Vineet Kumar, Vladimir Petrov, Francesco Fiori, Quentin Python, Meng Xiao, Hao Liu, Sourav Sen, Viktor Khristenko, Marco Trovato, Fan Xia, Xiao Wang, Bibhuprasad Mahakud, Jing Li, Rajat Gupta, Lei Feng, Muhammad Waqas, Hui Wang, Seungkyu Ha, Davide Cieri, Maren Tabea Meinhard, Giorgia Rauco, Ali Harb, Benjamin William Allen, Pratyush Das, Miao Hu, Lei Li

The performance of missing transverse momentum (Tmiss) reconstruction algorithms for the CMS experiment is presented, using proton-proton collisions at a center-of-mass energy of 13 TeV, collected at the CERN LHC in 2016. The data sample corresponds to an ...

2019

A Personalized Approach to Improve Walking Detection in Real-Life Settings: Application to Children with Cerebral Palsy

Kamiar Aminian, Anisoara Ionescu, Lena Carcreff, Stéphane Armand

Although many methods have been developed to detect walking by using body-worn inertial sensors, their performances decline when gait patterns become abnormal, as seen in children with cerebral palsy (CP). The aim of this study was to evaluate if fine-tuni ...

2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.