Publication

Randomization in the two-parameter optimal stopping problem

Related publications (119)

The micro-world of cographs

Dominique de Werra

Cographs constitute a small point in the atlas of graph classes. However, by zooming in on this point, we discover a complex world, where many parameters jump from finiteness to infinity. In the present paper, we identify several milestones in the world of ...
ELSEVIER2022

Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation

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

Bootstrapping parameters for the approximate homomorphic-encryption scheme of Cheon et al., CKKS (Asiacrypt 17), are usually instantiated using sparse secrets to be efficient. However, using sparse secrets constrains the range of practical parameters withi ...
SPRINGER INTERNATIONAL PUBLISHING AG2022

Intrinsic area near the origin for self-similar growth-fragmentations and related random surfaces

We study the behaviour of a natural measure defined on the leaves of the genealogical tree of some branching processes, namely self-similar growth-fragmentation processes. Each particle, or cell, is attributed a positive mass that evolves in continuous tim ...
2022

Representation Learning for Multi-relational Data

Eda Bayram

Recent years have witnessed a rise in real-world data captured with rich structural information that can be better depicted by multi-relational or heterogeneous graphs.However, research on relational representation learning has so far mostly focused on the ...
EPFL2021

Belief Control Strategies for Interactions Over Weakly-Connected Graphs

Ali H. Sayed, Bicheng Ying

In diffusion social learning over weakly-connected graphs, it has been shown recently that influential agents shape the beliefs of non-influential agents. This paper analyzes this mechanism more closely and addresses two main questions. First, the article ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

On Consensusability of Linear Interconnected Multi-Agent Systems and Simultaneous Stabilization

Giancarlo Ferrari Trecate, Mustafa Sahin Turan, Liang Xu

Consensusability of multi-agent systems (MASs) certifies the existence of a distributed controller capable of driving the states of each subsystem to a consensus value. We study the consensusability of linear interconnected MASs (LIMASs) where, as in sever ...
2021

Improved Ramsey-type results for comparability graphs

Istvan Tomon, Dániel József Korándi

Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if G is an n-vertex graph that is ...
CAMBRIDGE UNIV PRESS2020

Braided rivers networks dynamics: analyzing topographic data from a large flume experiment

Christophe Ancey, Daniel Vito Papa

Braided rivers are highly dynamical systems characterized by varying network-like structures even under quasi-steady conditions. Understanding their dynamics is crucial in geomorphology and river engineering (e.g., river restoration in Alpine and piedmond ...
2020

Joint Graph-based Depth Refinement and Normal Estimation

Pascal Frossard, Mireille El Gheche, Mattia Rossi

Depth estimation is an essential component in understanding the 3D geometry of a scene, with numerous applications in urban and indoor settings. These scenes are characterized by a prevalence of human made structures, which in most of the cases, are either ...
2020

Learning Graph Influence From Social Interactions

Ali H. Sayed, Virginia Bordignon, Augusto José Rabelo Almeida Santos

In social learning, agents form their opinions or beliefs about certain hypotheses by exchanging local information. This work considers the recent paradigm of weak graphs, where the network is partitioned into sending and receiving components, with the for ...
IEEE2020

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.