Publications associées à The scale axis picture show

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.

Learning to Play Sequential Games versus Unknown Opponents

Maryam Kamgarpour, Andreas Krause, Ilija Bogunovic

We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to successfully interact with the opponent. While most previous approaches consider k ...

Curran Associates, Inc.2020

Observations on the LPN Solving Algorithm from Eurocrypt'16

Serge Vaudenay, Sonia Mihaela Bogos

In this note we re-evaluate the Eurocrypt’16 paper by Zhang et al. [9] in the area of LPN solving algorithms. We present the history of LPN solving algorithms and give the general description of the algorithm from [9]. While this new algorithm claims to im ...

2016

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Francesco Mondada, Michael Bonani

This chapter presents a disaster recovery scenario that has been used throughout the ASCENS project as a reference to coordinate the study of distributed algorithms for robot ensembles. We first introduce the main traits and open problems in the design of ...

Springer2015

Bifurcation at isolated singular points for a degenerate elliptic eigenvalue problem

Charles Stuart

We consider bifurcation from the line of trivial solutions for a nonlinear eigenvalue problem on a bounded open subset, Omega, of R-N with N >= 3, containing 0. The leading term is a degenerate elliptic operator of the form L(u) = del . A del u where A is ...

Pergamon-Elsevier Science Ltd2015

Elliptic equations with general singular lower order term and measure data

Linda Maria De Cave

In this paper we study a nonlinear elliptic boundary value problem with a general singular lower order term, whose model is {-Delta u = H(u)mu, in Omega, u = 0 on partial derivative Omega, u > 0 on Omega, where Omega is an open bounded subset of R-N, mu is ...

Pergamon-Elsevier Science Ltd2015

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

An Efficient Algorithm for Level Set Method Preserving Distance Function

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

Institute of Electrical and Electronics Engineers2012

The scale axis picture show

Graph Chatbot

Chattez avec Graph Search

Learning to Play Sequential Games versus Unknown Opponents

When Stuck, Flip a Coin

Observations on the LPN Solving Algorithm from Eurocrypt'16

Centrality of trees for capacitated -center

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Bifurcation at isolated singular points for a degenerate elliptic eigenvalue problem

Elliptic equations with general singular lower order term and measure data

Centrality of Trees for Capacitated k-Center

An Efficient Algorithm for Level Set Method Preserving Distance Function

When Stuck, Flip a Coin

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Observations on the LPN Solving Algorithm from Eurocrypt'16

Learning to Play Sequential Games versus Unknown Opponents

Centrality of trees for capacitated -center

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Bifurcation at isolated singular points for a degenerate elliptic eigenvalue problem

Centrality of Trees for Capacitated k-Center

Elliptic equations with general singular lower order term and measure data

An Efficient Algorithm for Level Set Method Preserving Distance Function